The Countable Henkin Principle
DOI10.1007/978-3-319-09719-0_13zbMath1347.03063OpenAlexW2145163492MaRDI QIDQ3454812
Publication date: 27 November 2015
Published in: Studies in Universal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09719-0_13
completenessinferenceBaire category theoremomitting typesLindenbaum's lemmadeducibilityArchimedean inferencecountable Henkin principlefinitely consistentmaximally consistentprobabilistic modality
Modal logic (including the logic of norms) (03B45) Classical propositional logic (03B05) Proof theory in general (including proof-theoretic semantics) (03F03) Basic properties of first-order languages and structures (03C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axiomatising the logic of computer programming
- Interactive epistemology. II: Probability
- A modal proof theory for final polynomial coalgebras
- Intuitive Probability Logic
- Deduction Systems for Coalgebras Over Measurable Spaces
- On ω-consistency and related properties
- A generalization of the concept ofω-completeness
- A Complete Deductive System for Probability Logic
- On the role of the Baire Category Theorem and Dependent Choice in the foundations of logic
- The Discovery of My Completeness Proofs
- Stone Duality for Markov Processes
- The completeness of the first-order functional calculus
- Completeness in the theory of types
- A proof of the completeness theorem of Grödel
- A generalization of the concept of ω-consistency
- Probability logic for type spaces
This page was built for publication: The Countable Henkin Principle