You are not currently logged in.
Access JSTOR through your library or other institution:
A Complete and Consistent Formal System for Sortals
Max A. Freund
Studia Logica: An International Journal for Symbolic Logic
Vol. 65, No. 3 (Aug., 2000), pp. 367-381
Published by: Springer
Stable URL: http://www.jstor.org/stable/20016198
Page Count: 15
You can always find the topics here!Topics: Quantification, Logical theorems, Semantics, Philosophical object, Predicates, Metatheorems, Predication, Predicate logic, Syntax, Grammatical clauses
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
A formal logical system for sortal quantifiers, sortal identity and (second order) quantification over sortal concepts is formulated. The absolute consistency of the system is proved. A completeness proof for the system is also constructed. This proof is relative to a concept of logical validity provided by a semantics, which assumes as its philosophical background an approach to sortals from a modern form of conceptualism.
Studia Logica: An International Journal for Symbolic Logic © 2000 Springer