Complete infinitary type logics

Studia Logica 63 (1):85-119 (1999)
For each regular cardinal κ, we set up three systems of infinitary type logic, in which the length of the types and the length of the typed syntactical constructs are $\Sigma _{}$ , the global system $\text{g}\Sigma _{}$ and the τ-system $\tau \Sigma _{}$ . A full cut elimination theorem is proved for the local systems, and about the τ-systems we prove that they admit cut-free proofs for sequents in the τ-free language common to the local and global systems. These two results follow from semantic completeness proofs. Thus every sequent provable in a global system has a cut-free proof in the corresponding τ-systems. It is, however, an open question whether the global systems in themselves admit cut elimination
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/A:1005271521209
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,658
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

5 ( #363,557 of 1,725,935 )

Recent downloads (6 months)

2 ( #268,758 of 1,725,935 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.