Universal models for the positive fragment of intuitionistic logic

Authors
Publication date 2017
Host editors
  • H.H. Hansen
  • S.E. Murray
  • M. Sadrzadeh
  • H. Zeevat
Book title Logic, Language, and Computation
Book subtitle 11th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2015, Tbilisi, Georgia, September 21-26, 2015 : revised selected papers
ISBN
  • 9783662543313
ISBN (electronic)
  • 9783662543320
Series Lecture Notes in Computer Science
Event 11th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2015, Tbilisi, Georgia, September 21-26, 2015,
Pages (from-to) 229-250
Publisher Berlin: Springer
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract We describe the n-universal model U(n) of the positive fragment of the intuitionistic propositional calculus IPC. We show that U(n) is isomorphic to a generated submodel of U(n) – the n-universal model of IPC. Using U(n), we give an alternative proof of Jankov’s theorem stating that the intermediate logic KC, the logic of the weak law of excluded middle, is the greatest intermediate logic extending IPC that proves exactly the same positive formulas as IPC.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-662-54332-0_13
Permalink to this page
Back