The Boolean algebra of logic

DOI10.1090/S0002-9904-1975-13747-5zbMath0324.02044MaRDI QIDQ4087168

William P. Hanf

Publication date: 1975

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Structure theory of Boolean algebras (06E05) Logical aspects of Boolean algebras (03G05) General logic (03B99) Other classical first-order model theory (03C68)

Related Items (14)

Extension of relatively σ-additive probabilities on Boolean algebras of logic ⋮ Fine hierarchy and definable index sets ⋮ THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS ⋮ The Boolean Algebra of Piecewise Testable Languages ⋮ Extension and interpretability ⋮ The Boolean algebra of the theory of linear orders ⋮ First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories ⋮ The property of being a model complete theory is preserved by Cartesian extensions ⋮ Confident and consistent partial learning of recursive functions ⋮ Semantically universal classes of models ⋮ An uncountable Jónsson algebra in a minimal variety ⋮ A.D. Taimanov and model theory in Kazakhstan ⋮ Boolean sentence algebras: Isomorphism constructions ⋮ Turing machine computations in finitely axiomatizable theories

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Undecidability and nonperiodicity for tilings of the plane
• Hierarchies of Boolean algebras

This page was built for publication: The Boolean algebra of logic