A note concerning the notion of satisﬁability

Horsten, Leon

A note concerning the notion of satisﬁability

Dateien

Horsten_2-19o38kfdi5rgk6.pdfGröße: 1.13 MBDownloads: 28

Datum

2005

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Philosophie

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Logique et Analyse. National Center for Research in Logic. 2005, 47(185/188), pp. 463-468. ISSN 0024-5836. eISSN 2295-5836

Zusammenfassung

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.

Fachgebiet (DDC)

100 Philosophie

Zitieren

ISO 690

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

BibTex

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

RDF

<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/server/rdf/resource/123456789/56954">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56954/3/Horsten_2-19o38kfdi5rgk6.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dc:creator>Horsten, Leon</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/56954/3/Horsten_2-19o38kfdi5rgk6.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-22T15:20:23Z</dcterms:available>
    <dc:contributor>Horsten, Leon</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <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>
    <dcterms:title>A note concerning the notion of satisﬁability</dcterms:title>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-03-22T15:20:23Z</dc:date>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:issued>2005</dcterms:issued>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56954"/>
  </rdf:Description>
</rdf:RDF>

URL der Originalveröffentl.

https://www.jstor.org/stable/44084787

Prüfdatum der URL

2022-03-22

Universitätsbibliographie

Nein

Begutachtet

Ja