Equational treatment of first-order logic

DOI10.1007/BF01190764zbMath0819.03001OpenAlexW2094696613MaRDI QIDQ1344840

Jan Mycielski

Publication date: 22 February 1995

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01190764

zbMATH Keywords

Skolem functionsBoolean prime ideal theoremBirkhoff's completeness theoremcomplete translation of first-order logic into equational logicGödel-Mal'tsev completeness theoremtwo-sorted algebras

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Classical first-order logic (03B10) Equational logic, Mal'tsev conditions (08B05) Equational classes, universal algebra in model theory (03C05)

Cites Work

• Unnamed Item
• Can mathematics explain natural intelligence?
• A model of the neocortex
• The meaning of pure mathematics
• Quantifier-free versions of first order logic and their psychological significance
• Discriminator varieties and symbolic computation
• Remarks and problems on a lattice of equational chapters
• Cuts, consistency statements and interpretations
• The Axiom of Choice, the Löwenheim-Skolem Theorem and Borel models

This page was built for publication: Equational treatment of first-order logic