This HTML5 document contains 34 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-ithttp://it.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://www-mgi.informatik.rwth-aachen.de/Publications/pub/graedel/
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Description_logic
dbo:wikiPageWikiLink
dbr:Counting_quantification
Subject Item
dbr:Counting_quantifiers
dbo:wikiPageWikiLink
dbr:Counting_quantification
dbo:wikiPageRedirects
dbr:Counting_quantification
Subject Item
dbr:Counting_quantifier
dbo:wikiPageWikiLink
dbr:Counting_quantification
dbo:wikiPageRedirects
dbr:Counting_quantification
Subject Item
dbr:Uniqueness_quantification
dbo:wikiPageWikiLink
dbr:Counting_quantification
Subject Item
dbr:Quantifier_(logic)
dbo:wikiPageWikiLink
dbr:Counting_quantification
Subject Item
dbr:Counting_quantification
rdfs:label
Counting quantification Counting quantifier
rdfs:comment
A counting quantifier is a mathematical term for a quantifier of the form "there exists at least k elements that satisfy property X".In first-order logic with equality, counting quantifiers can be defined in terms of ordinary quantifiers, so in this context they are a notational shorthand.However, they are interesting in the context of logics such as two-variable logic with counting that restrict the number of variables in formulas.Also, generalized counting quantifiers that say "there exists infinitely many" are not expressible using a finite number of formulas in first-order logic.
dcterms:subject
dbc:Quantifier_(logic)
dbo:wikiPageID
2150531
dbo:wikiPageRevisionID
1121415323
dbo:wikiPageWikiLink
dbr:Mathematics dbr:Uniqueness_quantification dbr:Recursive_definition dbc:Quantifier_(logic) dbr:Two-variable_logic_with_counting dbr:First-order_logic dbr:Lindström_quantifier dbr:Quantifier_(logic)
dbo:wikiPageExternalLink
n16:gorc2.ps
owl:sameAs
wikidata:Q5177156 dbpedia-it:Counting_quantifier n13:4iR1N freebase:m.06qhn_
dbp:wikiPageUsesTemplate
dbt:Oclc dbt:Logic-stub
dbo:abstract
A counting quantifier is a mathematical term for a quantifier of the form "there exists at least k elements that satisfy property X".In first-order logic with equality, counting quantifiers can be defined in terms of ordinary quantifiers, so in this context they are a notational shorthand.However, they are interesting in the context of logics such as two-variable logic with counting that restrict the number of variables in formulas.Also, generalized counting quantifiers that say "there exists infinitely many" are not expressible using a finite number of formulas in first-order logic.
gold:hypernym
dbr:Term
prov:wasDerivedFrom
wikipedia-en:Counting_quantification?oldid=1121415323&ns=0
dbo:wikiPageLength
1824
foaf:isPrimaryTopicOf
wikipedia-en:Counting_quantification
Subject Item
wikipedia-en:Counting_quantification
foaf:primaryTopic
dbr:Counting_quantification