Faster access than browser!
20 relations: Abstract logic, Abstract model theory, Category theory, Closure (mathematics), Compactness theorem, First-order logic, Heinz-Dieter Ebbinghaus, Institution (computer science), Johan van Benthem (logician), Jon Barwise, Löwenheim–Skolem theorem, Lindström quantifier, Logica Universalis, Mathematical logic, Negation, Per Lindström, Solomon Feferman, Springer Science+Business Media, Strength (mathematical logic), Theoria (philosophy journal).
Abstract logic
In mathematical logic, an abstract logic is a formal system consisting of a class of sentences and a satisfaction relation with specific properties related to occurrence, expansion, isomorphism, renaming and quantification.
New!!: Lindström's theorem and Abstract logic · See more »
Abstract model theory
In mathematical logic, abstract model theory is a generalization of model theory which studies the general properties of extensions of first-order logic and their models.
New!!: Lindström's theorem and Abstract model theory · See more »
Category theory
Category theory formalizes mathematical structure and its concepts in terms of a labeled directed graph called a category, whose nodes are called objects, and whose labelled directed edges are called arrows (or morphisms).
New!!: Lindström's theorem and Category theory · See more »
Closure (mathematics)
A set has closure under an operation if performance of that operation on members of the set always produces a member of the same set; in this case we also say that the set is closed under the operation.
New!!: Lindström's theorem and Closure (mathematics) · See more »
Compactness theorem
In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model.
New!!: Lindström's theorem and Compactness theorem · See more »
First-order logic
First-order logic—also known as first-order predicate calculus and predicate logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science.
New!!: Lindström's theorem and First-order logic · See more »
Heinz-Dieter Ebbinghaus
Heinz-Dieter Ebbinghaus (born 22 February 1939 in Hemer, Province of Westphalia) is a German mathematician and logician.
New!!: Lindström's theorem and Heinz-Dieter Ebbinghaus · See more »
Institution (computer science)
The notion of institution has been created by Joseph Goguen and Rod Burstall in the late 1970s.
New!!: Lindström's theorem and Institution (computer science) · See more »
Johan van Benthem (logician)
Johannes Franciscus Abraham Karel (Johan) van Benthem (born 12 June 1949 in Rijswijk) is a University Professor (universiteitshoogleraar) of logic at the University of Amsterdam at the Institute for Logic, Language and Computation and professor of philosophy at Stanford University (at CSLI).
New!!: Lindström's theorem and Johan van Benthem (logician) · See more »
Jon Barwise
Kenneth Jon Barwise (June 29, 1942 – March 5, 2000) was an American mathematician, philosopher and logician who proposed some fundamental revisions to the way that logic is understood and used.
New!!: Lindström's theorem and Jon Barwise · See more »
Löwenheim–Skolem theorem
In mathematical logic, the Löwenheim–Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first-order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ. The result implies that first-order theories are unable to control the cardinality of their infinite models, and that no first-order theory with an infinite model can have a unique model up to isomorphism.
New!!: Lindström's theorem and Löwenheim–Skolem theorem · See more »
Lindström quantifier
In mathematical logic, a Lindström quantifier is a generalized polyadic quantifier.
New!!: Lindström's theorem and Lindström quantifier · See more »
Logica Universalis
Logica Universalis is a peer-reviewed academic journal which covers research related to Universal logic.
New!!: Lindström's theorem and Logica Universalis · See more »
Mathematical logic
Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics.
New!!: Lindström's theorem and Mathematical logic · See more »
Negation
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P (¬P), which is interpreted intuitively as being true when P is false, and false when P is true.
New!!: Lindström's theorem and Negation · See more »
Per Lindström
Per "Pelle" Lindström (9 April 1936 – 21 August 2009, Gothenburg)ASL, September 2009 was a Swedish logician, after whom Lindström's theorem and the Lindström quantifier are named.
New!!: Lindström's theorem and Per Lindström · See more »
Solomon Feferman
Solomon Feferman (December 13, 1928 – July 26, 2016) was an American philosopher and mathematician with works in mathematical logic.
New!!: Lindström's theorem and Solomon Feferman · See more »
Springer Science+Business Media
Springer Science+Business Media or Springer, part of Springer Nature since 2015, is a global publishing company that publishes books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing.
New!!: Lindström's theorem and Springer Science+Business Media · See more »
Strength (mathematical logic)
The relative strength of two systems of formal logic can be defined via model theory.
New!!: Lindström's theorem and Strength (mathematical logic) · See more »
Theoria (philosophy journal)
Theoria: A Swedish Journal of Philosophy and Psychology is a peer-reviewed academic journal publishing research in all areas of philosophy established in 1935 by Åke Petzäll (sv).
New!!: Lindström's theorem and Theoria (philosophy journal) · See more »
Redirects here:
Lindstroem theorem, Lindstroem's theorem, Lindstrom theorem, Lindstrom's theorem, Lindström theorem.
