Metraipolis › archive › dc_0c63cb4e171f

Tableaux Rules for Theories of Definite Descriptions in Positive Free Logic with Some Philosophical Remarks — arXiv:2610.40830

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40830
License (as archived)
CC0-1.0
Archived
2026-11-03T05:50:22.473Z
SHA-256 of the archived text
930f0b1e549145b2c09a6885ad60edb6d58bd9e599db88a53e3f24eb1612777e
Stable URL of this page
https://metraipolis.com/documento/dc_0c63cb4e171f

How to cite

Tableaux Rules for Theories of Definite Descriptions in Positive Free Logic with Some Philosophical Remarks — arXiv:2610.40830 — arXiv (en), https://arxiv.org/abs/2610.40830 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0c63cb4e171f (Metraipolis archive dc_0c63cb4e171f, sha256 930f0b1e549145b2c09a6885ad60edb6d58bd9e599db88a53e3f24eb1612777e)
BibTeX
@misc{dc0c63cb4e171f,
  title = {Tableaux Rules for Theories of Definite Descriptions in Positive Free Logic with Some Philosophical Remarks — arXiv:2610.40830},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40830},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0c63cb4e171f; sha256 930f0b1e549145b2c09a6885ad60edb6d58bd9e599db88a53e3f24eb1612777e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40830. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

While Russell's theory of definite descriptions, expressions of the form 'the F', is almost incontrovertible in classical logic, in free logic matters stand differently. Several alternatives have been proposed. In Lambert's hierarchy, the weakest theory is his minimal free theory of definite descriptions (MFD), which only says that anything is the F iff it is the unique existing F, the strongest one is a chosen object theory in which all improper definite descriptions refer to the same object (FD2). Intermediate is Lambert's FD1, which adds ix(x = t) = t as an axiom to MFD. MFD is very weak. FD2 is very strong. One might hope to find intermediate systems in which ix(x = t) = t is provable from more fundamental principles. The present paper considers one avenue where one might hope to find them and closes it. Two theories, FDA and FDH, will be considered that are motivated by considerations from proof-theoretic semantics. The former turns out to be equivalent to FD2, the latter to have unreasonable consequences. A third theory, similarly motivated, is also not viable. The philosophical upshot of this is briefly discussed.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.40830 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:35:02.111Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).