- 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
Definability and quantifier elimination for j3-theories
Studia Logica 46 (1):37 - 54 (1987)
Abstract
The Joint Non-Trivialization Theorem, two Definability Theorems and the generalized Quantifier Elimination Theorem are proved for J 3-theories. These theories are three-valued with more than one distinguished truth-value, reflect certain aspects of model type logics and can. be paraconsistent. J 3-theories were introduced in the author's doctoral dissertation.My notes
Similar books and articles
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
Definability and definable groups in simple theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.
Proof normalization modulo.Gilles Dowek & Benjamin Werner - 2003 - Journal of Symbolic Logic 68 (4):1289-1316.
Relative truth definability of axiomatic truth theories.Kentaro Fujimoto - 2010 - Bulletin of Symbolic Logic 16 (3):305-344.
Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
Quantifier Elimination and Other Model-Theoretic Properties of BL-Algebras.Tommaso Cortonesi, Enrico Marchioni & Franco Montagna - 2011 - Notre Dame Journal of Formal Logic 52 (4):339-379.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Analytics
Added to PP
2009-01-28
Downloads
41 (#377,987)
6 months
7 (#425,192)
2009-01-28
Downloads
41 (#377,987)
6 months
7 (#425,192)
Historical graph of downloads
Citations of this work
First-order swap structures semantics for some Logics of Formal Inconsistency.Marcelo E. Coniglio, Aldo Figallo-Orellano & Ana Claudia Golzio - 2020 - Journal of Logic and Computation 30 (6):1257-1290.
On the way to a Wider model theory: Completeness theorems for first-order logics of formal inconsistency.Walter Carnielli, Marcelo E. Coniglio, Rodrigo Podiacki & Tarcísio Rodrigues - 2014 - Review of Symbolic Logic 7 (3):548-578.
On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
Fidel Semantics for Propositional and First-Order Version of the Logic of CG’3.Aldo Figallo Orellano, Miguel Pérez-Gaspar & Everardo Bárcenas - forthcoming - Logic and Logical Philosophy:1-18.
References found in this work
Many-valued logics.J. Barkley Rosser - 1952 - Westport, Conn.: Greenwood Press. Edited by Atwell R. Turquette.
Mathematical Logic in Latin America: Proceedings of the IV Latin American Symposium on Mathematical Logic Held in Santiago, December 1978.Ayda I. Arruda, R. Chuaqui & Newton C. A. Costa (eds.) - 1980 - New York: sole distributors for the U.S.A. and Canada, Elsevier North-Holland.
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-7c76586df8-hc2g5 uwo