David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 53 (3):937-960 (1988)
We use connections between conjunctive game formulas and the theory of inductive definitions to define the notions of a coinductive formula and its approximations. Corresponding to the theory of conjunctive game formulas we develop a theory of coinductive formulas, including a covering theorem and a normal form theorem for many sorted languages. Applying both theorems and the results on "model interpolation" obtained in this paper, we prove a many-sorted interpolation theorem for ω 1 ω-logic, which considers interpolation with respect to the language symbols, the quantifiers, the identity, and countably infinite conjunction and disjunction
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
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.
Citations of this work BETA
No citations found.
Similar books and articles
Martin Otto (2000). An Interpolation Theorem. Bulletin of Symbolic Logic 6 (4):447-462.
Douglas N. Hoover (1982). A Normal Form Theorem for Lω 1p, with Applications. Journal of Symbolic Logic 47 (3):605 - 624.
Solomon Feferman (2008). Harmonious Logic: Craig's Interpolation Theorem and Its Descendants. Synthese 164 (3):341 - 357.
Jan Krajíček (1997). Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic. Journal of Symbolic Logic 62 (2):457-486.
Hiroakira Ono (1986). Craig's Interpolation Theorem for the Intuitionistic Logic and its Extensions—a Semantical Approach. Studia Logica 45 (1):19 - 33.
Jouko Väänänen (2008). The Craig Interpolation Theorem in Abstract Model Theory. Synthese 164 (3):401 - 420.
Larisa L. Maksimova (1979). Interpolation Properties of Superintuitionistic Logics. Studia Logica 38 (4):419 - 428.
Gerard R. Renardel de Lavalette (2008). Interpolation in Computing Science: The Semantics of Modularization. Synthese 164 (3):437-450.
Jan Krajíček (1998). Discretely Ordered Modules as a First-Order Extension of the Cutting Planes Proof System. Journal of Symbolic Logic 63 (4):1582-1596.
Added to index2009-01-28
Total downloads9 ( #153,019 of 1,096,880 )
Recent downloads (6 months)7 ( #31,275 of 1,096,880 )
How can I increase my downloads?