Semantics and completeness for schematic logic
From MaRDI portal
Recommendations
Cites work
- A Logic for Frege’s Theorem
- scientific article; zbMATH DE number 3710115 (Why is no real title available?)
- scientific article; zbMATH DE number 50939 (Why is no real title available?)
- scientific article; zbMATH DE number 1092439 (Why is no real title available?)
- scientific article; zbMATH DE number 957946 (Why is no real title available?)
- Mathematical logic. A course with exercises. Part II. Recursion theory, Gödel's theorems, set theory, model theory. Translated from the 1993 French original by Donald H. Pelletier
- Mathematical thought and its objects
- Reflecting on incompleteness
- Understanding the infinite
Cited in
(7)- Semantic trees for Dummett's logic LC
- Completeness for ancestral logic via a computationally-meaningful semantics
- Completeness proof by semantic diagrams for transitive closure of accessibility relation
- Schemata: The Concept of Schema in the History of Logic
- A Schemata Calculus for Propositional Logic
- The Smyth Completion
- On conceptual completeness of syntactic-semantical systems
This page was built for publication: Semantics and completeness for schematic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013623)