A note concerning the notion of satisfiability

Cite This

Files in this item

Checksum: MD5:c17d6ad0539adeb3545434de9b5ff585

HORSTEN, Leon, 2005. A note concerning the notion of satisfiability. In: Logique et Analyse. National Center for Research in Logic. 47(185/188), pp. 463-468. ISSN 0024-5836. eISSN 2295-5836

@article{Horsten2005conce-56954, title={A note concerning the notion of satisfiability}, url={https://www.jstor.org/stable/44084787}, year={2005}, number={185/188}, volume={47}, issn={0024-5836}, journal={Logique et Analyse}, pages={463--468}, author={Horsten, Leon} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/56954"> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-22T15:20:23Z</dc:date> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56954/3/Horsten_2-19o38kfdi5rgk6.pdf"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56954/3/Horsten_2-19o38kfdi5rgk6.pdf"/> <dc:creator>Horsten, Leon</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-22T15:20:23Z</dcterms:available> <dc:contributor>Horsten, Leon</dc:contributor> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56954"/> <dcterms:title>A note concerning the notion of satisfiability</dcterms:title> <dcterms:abstract xml:lang="eng">Tarski has shown how the argumentation of the liar paradox can be used to prove a theorem about truth in formalized languages. In this paper, it is shown how the paradox concerning the least undefinable ordinal can be used to prove a no go-theorem concerning the notion of satisfaction in formalized languages. Also, the connection of this theorem with the absolute notion of definability is discussed.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:rights>terms-of-use</dc:rights> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/40"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:language>eng</dc:language> <dcterms:issued>2005</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> </rdf:Description> </rdf:RDF>

Downloads since Mar 22, 2022 (Information about access statistics)

Horsten_2-19o38kfdi5rgk6.pdf 11

This item appears in the following Collection(s)

Search KOPS


Browse

My Account