About: Abstract logic

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Abstract logic Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FAbstract_logic&invfp=IFP_OFF&sas=SAME_AS_OFF

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. Based on Lindström's characterization, first-order logic is, up to equivalence, the only abstract logic that is countably compact and has Löwenheim number ω.

Attributes	Values
rdfs:label	Abstract logic (en) Abstracte logica (nl)
rdfs:comment	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. Based on Lindström's characterization, first-order logic is, up to equivalence, the only abstract logic that is countably compact and has Löwenheim number ω. (en) In de wiskundige logica is een abstracte logica een formeel systeem, dat bestaat uit een klasse van zinnen en een met specifieke eigenschappen met betrekking tot voorkomen, expansie, isomorfisme, hernoeming en kwantificering. Gebaseerd op Per Lindströms karakterisering is de eerste orde logica, op en tot met gelijkwaardigheid, de enige abstracte logica, die is en het Löwenheim-getal ω heeft. (nl)
dcterms:subject	Mathematical logic
Wikipage page ID	28877379 (xsd:integer)
Wikipage revision ID	1102820758 (xsd:integer)
Link from a Wikipage to another Wikipage	Löwenheim number Mathematical logic Countably compact First-order logic Formal system Mathematical logic Sentence (mathematical logic) Satisfaction relation Per Lindström (logician)
sameAs	Abstract logic Abstract logic Abstract logic Abstract logic Abstract logic
dbp:wikiPageUsesTemplate	dbt:Annotated_link dbt:Other_uses dbt:Reflist dbt:Mathematical_logic dbt:Mathlogic-stub
has abstract	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. Based on Lindström's characterization, first-order logic is, up to equivalence, the only abstract logic that is countably compact and has Löwenheim number ω. (en) In de wiskundige logica is een abstracte logica een formeel systeem, dat bestaat uit een klasse van zinnen en een met specifieke eigenschappen met betrekking tot voorkomen, expansie, isomorfisme, hernoeming en kwantificering. Gebaseerd op Per Lindströms karakterisering is de eerste orde logica, op en tot met gelijkwaardigheid, de enige abstracte logica, die is en het Löwenheim-getal ω heeft. (nl)
gold:hypernym	System
prov:wasDerivedFrom	wikipedia-en:Abstract_logic?oldid=1102820758&ns=0
page length (characters) of wiki page	1055 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Abstract_logic
is Link from a Wikipage to another Wikipage of	Löwenheim number Löwenheim–Skolem theorem Strength (mathematical logic) Lindström's theorem Abstract logic (disambiguation) Abstraction (mathematics) Trilobite (disambiguation)
is Wikipage disambiguates of	Abstract logic (disambiguation)
is foaf:primaryTopic of	wikipedia-en:Abstract_logic

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software