HOME

TheInfoList



OR:

In mathematical logic, geometric logic is an
infinitary In mathematics and logic, an operation is finitary if it has finite arity, i.e. if it has a finite number of input values. Similarly, an infinitary operation is one with an infinite number of input values. In standard mathematics, an operati ...
generalisation of coherent logic, a restriction of
first-order logic First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over ...
due to
Skolem Thoralf Albert Skolem (; 23 May 1887 – 23 March 1963) was a Norwegian mathematician who worked in mathematical logic and set theory. Life Although Skolem's father was a primary school teacher, most of his extended family were farmers. Skole ...
that is
proof-theoretic Proof theory is a major branchAccording to , proof theory is one of four domains mathematical logic, together with model theory, axiomatic set theory, and recursion theory. consists of four corresponding parts, with part D being about "Proof Theor ...
ally tractable. Geometric logic is capable of expressing many mathematical theories and has close connections to
topos theory In mathematics, a topos (, ; plural topoi or , or toposes) is a category that behaves like the category of sheaves of sets on a topological space (or more generally, on a site). Topoi behave much like the category of sets and possess a notion ...
.


Definitions

A theory of first-order logic is geometric if it can be axiomatised using only axioms of the form \bigwedge_ \phi_ \vee \dots \vee \phi_ \implies \bigvee_ \phi_ \vee \dots \vee \phi_ where I and J are disjoint collections of formulae indices that each may be infinite and the formulae φ are either atoms or negations of atoms. If all the axioms are finite (i.e., for each axiom, both I and J are finite), the theory is coherent.


Theorem

Every first-order theory has a coherent conservative extension.


Significance

list eight consequences of the above theorem that explain its significance (omitting footnotes and most references): #In the context of a
sequent calculus In mathematical logic, sequent calculus is a style of formal logical argumentation in which every line of a proof is a conditional tautology (called a sequent by Gerhard Gentzen) instead of an unconditional tautology. Each conditional tautolog ...
such as G3c, special coherent implications as axioms can be converted directly to inference rules without affecting the admissibility of the structural rules (Weakening, Contraction and Cut); #In similar terms, coherent theories are “the theories expressible by
natural deduction In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the "natural" way of reasoning. This contrasts with Hilbert-style systems, which instead use ...
rules in a certain simple form in which only atomic formulas play a critical part”; #Coherent implications form sequents that give a Glivenko class. In this case, the result, known as the first-order Barr’s Theorem, states that if each ''I''i: 0≤i≤n is a coherent implication and the sequent ''I''1, . . . , ''I''n ⇒ ''I''0 is classically provable then it is intuitionistically provable; #There are many examples of coherent/geometric theories: all algebraic theories, such as group theory and ring theory, all essentially algebraic theories, such as category theory, the theory of fields, the theory of local rings, lattice theory, projective geometry, the theory of separably closed local rings (aka “strictly Henselian local rings”) and the infinitary theory of torsion abelian groups; #Coherent/geometric theories are preserved by pullback along geometric morphisms between topoi (Maclane & Moerdijk 1992, chapter X); #Filtered colimits in Set of models of a coherent theory T are also models of T; #Special coherent implications ∀x. C ⊃ D generalise the Horn clauses from
logic programming Logic programming is a programming, database and knowledge representation paradigm based on formal logic. A logic program is a set of sentences in logical form, representing knowledge about some problem domain. Computation is performed by applyin ...
, where D is required to be an atom; in fact, they generalise the “clauses” of disjunctive logic programs, where D is allowed to be a disjunction of atoms. #Effective theorem-proving for coherent theories can, with (in relation to resolution) relative ease and clarity, be automated. As noted by Bezem et al ...the absence of Skolemisation (introduction of new function symbols) is no real hardship, and the non-conversion to clausal form allows the structure of ordinary mathematical arguments to be better retained.


Notes


Bibliography

* * (Two volumes, Oxford Logic Guides 43 & 44, 3rd volume in preparation) *


Further reading

*{{cite web , url=https://math.stackexchange.com/q/3908774#comment8061915_3908774 , title=Why is a geometric theory called “geometric”? , date=November 15, 2020 , work=
Stack Exchange Stack Exchange is a network of question-and-answer (Q&A) websites on topics in diverse fields, each site covering a specific topic, where questions, answers, and users are subject to a reputation award process. The reputation system allows t ...
Geometry Logic