Decision methods for linearly ordered Heyting algebras

Archive for Mathematical Logic 45 (4):411-422 (2006)
  Copy   BIBTEX

Abstract

The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable; a simple solution is here presented, inspired by related ideas in Gödel-Dummett logic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,953

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-11-03

Downloads
128 (#145,611)

6 months
11 (#272,636)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Basic proof theory.A. S. Troelstra - 1996 - New York: Cambridge University Press. Edited by Helmut Schwichtenberg.
A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.
Logics without the contraction rule.Hiroakira Ono & Yuichi Komori - 1985 - Journal of Symbolic Logic 50 (1):169-201.
Contraction-free sequent calculi for intuitionistic logic.Roy Dyckhoff - 1992 - Journal of Symbolic Logic 57 (3):795-807.
Logic with truth values in a linearly ordered Heyting algebra.Alfred Horn - 1969 - Journal of Symbolic Logic 34 (3):395-408.

View all 15 references / Add more references