DISTANCES BETWEEN FORMAL THEORIES

DOI10.1017/S1755020319000558zbMath1485.03079arXiv1807.01501MaRDI QIDQ5117596

Gergely Székely, Michèle Friend, Mohamed Khaled, Koen Lefever

Publication date: 26 August 2020

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.01501

zbMATH Keywords

conceptual distancedegrees of nonequivalencenetwork of theoriesrelativistic and classical kinematics

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15) Other applications of logic (03B80) Logic in the philosophy of science (03A10)

Related Items

TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY, On generalization of definitional equivalence to non-disjoint languages, In the Footsteps of Hilbert: The Andréka-Németi Group’s Logical Foundations of Theories in Physics, Modal logics that are both monotone and antitone: Makinson's extension results and affinities between logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logic road from special relativity to general relativity
• Complete axiomatizations for quantum actions
• Epimorphisms in cylindric algebras and definability in finite variable logic
• Natural deduction and arbitrary objects
• Cylindric algebras. Part II
• Modal languages and bounded fragments of predicate logic
• The finitely axiomatizable complete theories of non-associative arrow frames
• First order logic without equality on relativized semantics
• On generalization of definitional equivalence to non-disjoint languages
• Glymour and Quine on theoretical equivalence
• The foundations of thermodynamics
• Axiomatic Definitions of Programming Languages
• Properties Preserved under Definitional Equivalence and Interpretations
• Comparing Classical and Relativistic Kinematics in First-Order Logic
• How many varieties of cylindric algebras are there
• An axiomatic basis for computer programming
• Mutual definability does not imply definitional equivalence, a simple example
• Completeness in the theory of types
• The role of the axiom of induction in elementary arithmetic
• On the simplicity of ideas