Abstract
In this paper we show that an intensional logic TP of [4], with quantification over "individual concepts", is not recursively enumerable, and that it has, in fact, the degree of unsolvability of second order logic. TP has predicate letters, individual variables ranging over functions on a domain of contexts, propositional variables, V, ~, 3, =, and a T-operator T, which takes an individual variable x, and a wff A into a new wff TxA. TxA may be read 'A is the case at (or as of) x'. The quantifier V binds individual variables introduced with the T-operator, as well as those that appear with predicate letters and identity. A more formal account of the syntax of TP can be reconstructed from the truth clauses for the semantics of TP given in Section 1.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
