- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Decision methods for linearly ordered Heyting algebras
Archive for Mathematical Logic 45 (4):411-422 (2006)
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 logicAuthor's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Gödel algebras free over finite distributive lattices.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Annals of Pure and Applied Logic 155 (3):183-193.
n‐linear weakly Heyting algebras.Sergio A. Celani - 2006 - Mathematical Logic Quarterly 52 (4):404-416.
Logic with truth values in a linearly ordered Heyting algebra.Alfred Horn - 1969 - Journal of Symbolic Logic 34 (3):395-408.
Decidability problem for finite Heyting algebras.Katarzyna Idziak & Pawel M. Idziak - 1988 - Journal of Symbolic Logic 53 (3):729-735.
Involutive symmetric Gödel spaces, their algebraic duals and logic.A. Di Nola, R. Grigolia & G. Vitale - 2023 - Archive for Mathematical Logic 62 (5):789-809.
Computing coproducts of finitely presented Gödel algebras.Ottavio M. D’Antona & Vincenzo Marra - 2006 - Annals of Pure and Applied Logic 142 (1):202-211.
Not Every Splitting Heyting or Interior Algebra is Finitely Presentable.Alex Citkin - 2012 - Studia Logica 100 (1-2):115-135.
On the structure of linearly ordered pseudo-BCK-algebras.Anatolij Dvurečenskij & Jan Kühr - 2009 - Archive for Mathematical Logic 48 (8):771-791.
Analytics
Added to PP
2013-11-03
Downloads
128 (#37,184)
6 months
11 (#1,140,922)
2013-11-03
Downloads
128 (#37,184)
6 months
11 (#1,140,922)
Historical graph of downloads
Author's Profile
Citations of this work
Proof analysis in intermediate logics.Roy Dyckhoff & Sara Negri - 2012 - Archive for Mathematical Logic 51 (1):71-92.
In the shadows of the löwenheim-Skolem theorem: Early combinatorial analyses of mathematical proofs.Jan von Plato - 2007 - Bulletin of Symbolic Logic 13 (2):189-225.
The intensional side of algebraic-topological representation theorems.Sara Negri - 2017 - Synthese 198 (Suppl 5):1121-1143.
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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-594f89468-ckkwp uwo