The calculus of relations as a foundation for mathematics

DOI10.1007/s10817-006-9062-xzbMath1121.03018DBLPjournals/jar/Givant06OpenAlexW1971852817WikidataQ56686426 ScholiaQ56686426MaRDI QIDQ877838

Steven Givant

Publication date: 3 May 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9062-x

zbMATH Keywords

automated reasoningalgebraic theory of binary relationssubsystem of sentential logicthree-variable first-order logicvariable-free equational logic

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Foundations of classical theories (including reverse mathematics) (03B30) Equational classes, universal algebra in model theory (03C05) Cylindric and polyadic algebras; relation algebras (03G15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (9)

Expressive power and succinctness of the positive calculus of binary relations ⋮ Expressive Power and Succinctness of the Positive Calculus of Relations ⋮ FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH ⋮ Structural characterizations of the navigational expressiveness of relation algebras on a tree ⋮ Solving quantifier-free first-order constraints over finite sets and binary relations ⋮ Undecidability of Algebras of Binary Relations ⋮ Weak \(n\)-ary relational products in allegories ⋮ Tarskian Classical Relevant Logic ⋮ Map composition generalized to coherent collections of maps.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relation algebras by games
• Cylindric algebras. Part II
• Model theory.
• Some sufficient conditions for the representability of relation algebras
• Many-dimensional modal logics: theory and applications
• On representable relation algebras
• Undecidable theories
• Nonfinite axiomatizability results for cylindric and relation algebras
• Relational Methods in Computer Science
• Relation algebra reducts of cylindric algebras and an application to proof theory
• Provability with Finitely Many Variables
• A simplified formalization of predicate logic with identity
• Nonfinitizability of classes of representable cylindric algebras
• Einkleidung der Mathematik in Schröderschen Relativkalkul
• On the calculus of relations

This page was built for publication: The calculus of relations as a foundation for mathematics