Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Lindstrxc3xb6ms_theorem> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples per page.
- Lindstrxc3xb6ms_theorem abstract "In mathematical logic, Lindström's theorem (named after Swedish logician Per Lindström, who published it in 1969) states that first-order logic is the strongest logic (satisfying certain conditions, e.g. closure under classical negation) having both the (countable) compactness property and the (downward) Löwenheim–Skolem property.Lindström's theorem is perhaps the best known result of what later became known as abstract model theory, the basic notion of which is an abstract logic; the more general notion of an institution was later introduced, which advances from a set-theoretical notion of model to a category theoretical one. Lindström had previously obtained a similar result in studying first-order logics extended with Lindström quantifiers.Lindström's theorem has been extended to various other systems of logic in particular modal logics by Johan van Benthem and Sebastian Enqvist.".
- Lindstrxc3xb6ms_theorem wikiPageID "7510462".
- Lindstrxc3xb6ms_theorem wikiPageLength "3582".
- Lindstrxc3xb6ms_theorem wikiPageOutDegree "22".
- Lindstrxc3xb6ms_theorem wikiPageRevisionID "612860185".
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Abstract_logic.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Abstract_model_theory.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Category:Mathematical_logic.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Category:Metatheorems.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Category:Theorems_in_the_foundations_of_mathematics.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Category_theory.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Closure_(mathematics).
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Compactness_theorem.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink First-order_logic.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Institution_(computer_science).
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Johan_van_Benthem_(logician).
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Lindström_quantifier.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Logica_Universalis.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Löwenheim–Skolem_theorem.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Mathematical_logic.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Negation.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Per_Lindström.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Springer_Science+Business_Media.
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Strength_(mathematical_logic).
- Lindstrxc3xb6ms_theorem wikiPageWikiLink Theoria_(philosophy_journal).
- Lindstrxc3xb6ms_theorem wikiPageWikiLinkText "Lindström's theorem".
- Lindstrxc3xb6ms_theorem wikiPageUsesTemplate Template:Citation.
- Lindstrxc3xb6ms_theorem wikiPageUsesTemplate Template:Doi.
- Lindstrxc3xb6ms_theorem wikiPageUsesTemplate Template:Mathlogic-stub.
- Lindstrxc3xb6ms_theorem wikiPageUsesTemplate Template:Reflist.
- Lindstrxc3xb6ms_theorem subject Category:Mathematical_logic.
- Lindstrxc3xb6ms_theorem subject Category:Metatheorems.
- Lindstrxc3xb6ms_theorem subject Category:Theorems_in_the_foundations_of_mathematics.
- Lindstrxc3xb6ms_theorem hypernym Logic.
- Lindstrxc3xb6ms_theorem type Diacritic.
- Lindstrxc3xb6ms_theorem type Field.
- Lindstrxc3xb6ms_theorem type Redirect.
- Lindstrxc3xb6ms_theorem type Theorem.
- Lindstrxc3xb6ms_theorem comment "In mathematical logic, Lindström's theorem (named after Swedish logician Per Lindström, who published it in 1969) states that first-order logic is the strongest logic (satisfying certain conditions, e.g.".
- Lindstrxc3xb6ms_theorem label "Lindström's theorem".
- Lindstrxc3xb6ms_theorem sameAs Q2379128.
- Lindstrxc3xb6ms_theorem sameAs Sätze_von_Lindström.
- Lindstrxc3xb6ms_theorem sameAs Stelling_van_Lindström.
- Lindstrxc3xb6ms_theorem sameAs m.0263wvl.
- Lindstrxc3xb6ms_theorem sameAs Q2379128.
- Lindstrxc3xb6ms_theorem wasDerivedFrom Lindstrxc3xb6ms_theorem?oldid=612860185.
- Lindstrxc3xb6ms_theorem isPrimaryTopicOf Lindstrxc3xb6ms_theorem.