- 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
An abstract setting for Henkin proofs
Topoi 3 (1):37-41 (1984)
Abstract
A general result is proved about the existence of maximally consistent theories satisfying prescribed closure conditions. The principle is then used to give streamlined proofs of completeness and omitting-types theorems, in which inductive Henkin-style constructions are replaced by a demonstration that a certain theory respects a certain class of inference rules.Other Versions
No versions found
My notes
Similar books and articles
Henkin style completeness proofs in theories lacking negation.John L. Pollock - 1971 - Notre Dame Journal of Formal Logic 12 (4):509-511.
Completeness results for intuitionistic and modal logic in a categorical setting.M. Makkai & G. E. Reyes - 1995 - Annals of Pure and Applied Logic 72 (1):25-101.
We provide a simple and transparent construction of Hrushovski's strongly minimal fusions in the case where the fused strongly minimal sets are vector spaces. We strengthen Hrushovski's result by showing that the strongly minimal fusions are model complete.Jonathan P. Seldin - 1997 - Annals of Pure and Applied Logic 83 (1):23-101.
Completeness in Equational Hybrid Propositional Type Theory.Maria Manzano, Manuel Martins & Antonia Huertas - 2019 - Studia Logica 107 (6):1159-1198.
Completeness in Equational Hybrid Propositional Type Theory.Maria Manzano, Manuel Martins & Antonia Huertas - 2019 - Studia Logica 107 (6):1159-1198.
Effective completeness theorems for modal logic.Suman Ganguli & Anil Nerode - 2004 - Annals of Pure and Applied Logic 128 (1-3):141-195.
Syntactic features and synonymy relations: A unified treatment of some proofs of the compactness and interpolation theorems.George E. Weaver - 1994 - Studia Logica 53 (2):325 - 342.
Axiomatizations with context rules of inference in modal logic.Valentin Goranko - 1998 - Studia Logica 61 (2):179-197.
Proofs, Arbitrary Exemplifications, and Inductive Generalizations in Euler’s Mathematical Practice.Giovanni Ferraro - 2024 - In Bharath Sriraman (ed.), Handbook of the History and Philosophy of Mathematical Practice. Cham: Springer. pp. 2481-2502.
Analytics
Added to PP
2009-01-28
Downloads
99 (#212,723)
6 months
7 (#698,214)
2009-01-28
Downloads
99 (#212,723)
6 months
7 (#698,214)
Historical graph of downloads
Citations of this work
Varieties of complex algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
On the role of the baire category theorem and dependent choice in the foundations of logic.Robert Goldblatt - 1985 - Journal of Symbolic Logic 50 (2):412-422.
Quasi-apartness and neighbourhood spaces.Hajime Ishihara, Ray Mines, Peter Schuster & Luminiţa Vîţă - 2006 - Annals of Pure and Applied Logic 141 (1):296-306.
Hybrid Logic of the Hide and Seek Game.Katsuhiko Sano, Fenrong Liu & Dazhu Li - forthcoming - Studia Logica.
References found in this work
Admissible sets and structures: an approach to definability theory.Jon Barwise - 1975 - New York: Springer Verlag.
The completeness of the first-order functional calculus.Leon Henkin - 1949 - Journal of Symbolic Logic 14 (3):159-166.
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-667477cd97-lxkd2 dc2