The compactness of first-order logic:from gödel to lindström
From MaRDI portal
Publication:3141183
Recommendations
Cites work
- scientific article; zbMATH DE number 3882394 (Why is no real title available?)
- scientific article; zbMATH DE number 3122413 (Why is no real title available?)
- scientific article; zbMATH DE number 3550662 (Why is no real title available?)
- scientific article; zbMATH DE number 1257634 (Why is no real title available?)
- scientific article; zbMATH DE number 3261581 (Why is no real title available?)
- scientific article; zbMATH DE number 3348095 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- An Embedding Theorem for Algebric Systems
- Boolean Algebras and Their Application to Topology
- Completeness in the theory of types
- Definability and decision problems in arithmetic
- Definitions of compact
- Fragments of the propositional calculus
- Historique de la notion de compacite
- Note on An Embedding Theorem for Algebraic Systems
- On the metamathematics of algebra
- The completeness of the first-order functional calculus
Cited in
(7)- A Topological-algebraic Approach to the Compactness Theorem of Classical Logic
- Proofs of the compactness theorem
- scientific article; zbMATH DE number 4072898 (Why is no real title available?)
- scientific article; zbMATH DE number 1549026 (Why is no real title available?)
- Completeness and categoricity: Frege, gödel and model theory
- The context of inference
- Measure-based inconsistency-tolerant maintenance of database integrity
This page was built for publication: The compactness of first-order logic:from gödel to lindström
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141183)