Coinductive formulas and a many-sorted interpolation theorem
Keyword(s):
AbstractWe 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.
Keyword(s):
1977 ◽
Vol 67
(2)
◽
pp. 215-215
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 375
(3)
◽
pp. 2089-2153
◽
Keyword(s):
2018 ◽
Vol 12
(3)
◽
pp. 363-424
Keyword(s):
2007 ◽
Vol 17
(05n06)
◽
pp. 951-961
◽