An Entity of Type: Abstraction100002137, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematical logic, a set of logical formulae is deductively closed if it contains every formula that can be logically deduced from , formally: if always implies . If is a set of formulae, the deductive closure of is its smallest superset that is deductively closed. The deductive closure of a theory is often denoted or . This is a special case of the more general mathematical concept of closure — in particular, the deductive closure of is exactly the closure of with respect to the operation of logical consequence.

Property Value
dbo:abstract
  • In mathematical logic, a set of logical formulae is deductively closed if it contains every formula that can be logically deduced from , formally: if always implies . If is a set of formulae, the deductive closure of is its smallest superset that is deductively closed. The deductive closure of a theory is often denoted or . This is a special case of the more general mathematical concept of closure — in particular, the deductive closure of is exactly the closure of with respect to the operation of logical consequence. (en)
  • In de logica is de deductieve afsluiting van een verzameling proposities en een verzameling afleidingsregels de verzameling proposities zodanig dat deze elke propositie bevat die afleidbaar is uit met regels in . Formeel beschouwd is de deductieve afsluiting een afsluiting waarbij een verzameling proposities gesloten is onder afleidingsregels in . Binnen de kennistheorie wordt gediscussieerd of bepaalde deelverzamelingen van kennis, die bijvoorbeeld betrekking hebben op kennis of geloof over een bepaald onderwerp, afgesloten zijn onder deductie. (nl)
  • In matematica la chiusura deduttiva consiste nell'insieme di deduzioni che possono essere ricavate a partire da un insieme di assiomi. In altre parole, la chiusura deduttiva è l'insieme di tutte le formule che, tramite le regole di inferenza disponibili, sono conseguenza dell'insieme di assiomi considerato. In termini più formali, sia l'insieme di formule considerato, la sua chiusura deduttiva viene indicata con . (it)
  • Fecho dedutivo é uma propriedade de um conjunto de objetos (normalmente sentenças lógicas). Consideramos que um conjunto de objetos B possui fecho dedutivo ou é fechado sob uma determinada operação de consequência C se, para cada subconjunto B' de B, se B' se relaciona com um conjunto de objetos D através de C, então D é subconjunto de B. No contexto de lógica, o fecho lógico de um conjunto de sentenças B é o conjunto de todas as sentenças que podem ser deduzidas a partir de B. (pt)
dbo:wikiPageID
  • 7750539 (xsd:integer)
dbo:wikiPageLength
  • 1870 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1094902336 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • In mathematical logic, a set of logical formulae is deductively closed if it contains every formula that can be logically deduced from , formally: if always implies . If is a set of formulae, the deductive closure of is its smallest superset that is deductively closed. The deductive closure of a theory is often denoted or . This is a special case of the more general mathematical concept of closure — in particular, the deductive closure of is exactly the closure of with respect to the operation of logical consequence. (en)
  • In de logica is de deductieve afsluiting van een verzameling proposities en een verzameling afleidingsregels de verzameling proposities zodanig dat deze elke propositie bevat die afleidbaar is uit met regels in . Formeel beschouwd is de deductieve afsluiting een afsluiting waarbij een verzameling proposities gesloten is onder afleidingsregels in . Binnen de kennistheorie wordt gediscussieerd of bepaalde deelverzamelingen van kennis, die bijvoorbeeld betrekking hebben op kennis of geloof over een bepaald onderwerp, afgesloten zijn onder deductie. (nl)
  • In matematica la chiusura deduttiva consiste nell'insieme di deduzioni che possono essere ricavate a partire da un insieme di assiomi. In altre parole, la chiusura deduttiva è l'insieme di tutte le formule che, tramite le regole di inferenza disponibili, sono conseguenza dell'insieme di assiomi considerato. In termini più formali, sia l'insieme di formule considerato, la sua chiusura deduttiva viene indicata con . (it)
  • Fecho dedutivo é uma propriedade de um conjunto de objetos (normalmente sentenças lógicas). Consideramos que um conjunto de objetos B possui fecho dedutivo ou é fechado sob uma determinada operação de consequência C se, para cada subconjunto B' de B, se B' se relaciona com um conjunto de objetos D através de C, então D é subconjunto de B. No contexto de lógica, o fecho lógico de um conjunto de sentenças B é o conjunto de todas as sentenças que podem ser deduzidas a partir de B. (pt)
rdfs:label
  • Deductive closure (en)
  • Chiusura deduttiva (it)
  • Deductieve afsluiting (nl)
  • Fecho dedutivo (pt)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:notableIdea of
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License