Defining a Decidability Decider

Abstract

By extending the notion of a Well Formed Formula to include syntactically formalized rules for rejecting semantically incorrect expressions we recognize and reject expressions that have the semantic error of Pathological self-reference(Olcott 2004). The foundation of this system requires the notion of a BaseFact that anchors the semantic notions of True and False. When-so-ever a formal proof from BaseFacts of language L to a closed WFF X or ~X of language L does not exist X is decided to be semantically incorrect.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

The Decidability of the Class and the Axiom of Foundation.Dorella Bellè & Franco Parlamento - 2001 - Notre Dame Journal of Formal Logic 42 (1):41-53.
Approximate decidability in euclidean spaces.Armin Hemmerling - 2003 - Mathematical Logic Quarterly 49 (1):34-56.
Decidability of an Xstit Logic.Gillman Payette - 2014 - Studia Logica 102 (3):577-607.
On the decidability of the PVD class with equality.N. Peltier - 2001 - Logic Journal of the IGPL 9 (4):569-592.
An elementary system as and its semi‐completeness and decidability.Qin Jun - 1992 - Mathematical Logic Quarterly 38 (1):305-320.
Ł-decidability and decidability.J. Słupecki - 1972 - Bulletin of the Section of Logic 1 (3):38-43.
Decidability and generalized quantifiers.Andreas Baudisch (ed.) - 1980 - Berlin: Akademie Verlag.

Analytics

Added to PP
2018-02-19

Downloads
160 (#110,728)

6 months
50 (#73,620)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references