- 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
Decidability of Some Logics with Free Quantifier Variables
Mathematical Logic Quarterly 27 (2-6):17-22 (1981)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Decidability of Some Logics with Free Quantifier Variables.D. A. Anapolitanos & J. A. Väänänen - 1981 - Mathematical Logic Quarterly 27 (2‐6):17-22.
Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
Decidability of Some Extensions of J.R. I. Goldblatt - 1974 - Mathematical Logic Quarterly 20 (13‐18):203-206.
Quantifier elimination for modules with scalar variables.Lou van den Dries & Jan Holly - 1992 - Annals of Pure and Applied Logic 57 (2):161-179.
The Boolean Sentence Algebra of the Theory of Linear Ordering is Atomic with Respect to Logics with a Malitz Quantifier.Hans-Joachim Goltz - 1985 - Mathematical Logic Quarterly 31 (9-12):131-162.
The Boolean Sentence Algebra of the Theory of Linear Ordering is Atomic with Respect to Logics with a Malitz Quantifier.Hans-Joachim Goltz - 1985 - Mathematical Logic Quarterly 31 (9-12):131-162.
A note on decidability of variables in intuitionistic propositional logic.Katsumasa Ishii - 2018 - Mathematical Logic Quarterly 64 (3):183-184.
Negation‐Free Modal Logics.George F. Schumm & Roy Edelstein - 1979 - Mathematical Logic Quarterly 25 (13‐18):281-288.
Negation-Free Modal Logics.George F. Schumm & Roy Edelstein - 1979 - Mathematical Logic Quarterly 25 (13-18):281-288.
Some Elementary Results About the Equivalence of Computability and Decidability.Ulrich Huckenbeck - 1991 - Mathematical Logic Quarterly 37 (5‐6):77-84.
Analytics
Added to PP
2015-12-02
Downloads
33 (#125,351)
6 months
6 (#1,472,471)
2015-12-02
Downloads
33 (#125,351)
6 months
6 (#1,472,471)
Historical graph of downloads
Author's Profile
Citations of this work
On the general interpretation of first-order quantifiers.G. Aldo Antonelli - 2013 - Review of Symbolic Logic 6 (4):637-658.
On A New Semantics for First-Order Predicate Logic.István Németi, Johan van Benthem & Hajnal Andréka - 2017 - Journal of Philosophical Logic 46 (3):259-267.
On A New Semantics for First-Order Predicate Logic.István Németi, Johan Benthem & Hajnal Andréka - 2017 - Journal of Philosophical Logic 46 (3):259-267.
References found in this work
First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.
Logic with the quantifier “there exist uncountably many”.H. Jerome Keisler - 1970 - Annals of Mathematical Logic 1 (1):1-93.
Models and Ultraproducts: An Introduction.J. L. Bell & A. B. Slomson - 1972 - Journal of Symbolic Logic 37 (4):763-764.
Logic with the quantifier "there exist uncountably many".H. Jerome Keisler - 1970 - Annals of Mathematical Logic 1 (1):1.
Syntactical and semantical properties of generalized quantifiers.Mitsuru Yasuhara - 1966 - Journal of Symbolic Logic 31 (4):617-632.
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-68866f4b87-zhzfn uwo