Interpolation, Definability and Fixed Points in Interpretability Logics

13 years 6 months ago

Download www.loria.fr

In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the

Carlos Areces, Eva Hoogland, Dick de Jongh

Real-time Traffic

AIML 1998 | AIML 2008 | Arrow Interpolation | Fixed Point | Interpolation |

claim paper

» FixedPoint Definability and Polynomial Time on Chordal Graphs and Line Graphs

» FixedPoint Definability and Polynomial Time on Graphs with Excluded Minors

» A Note on Logic Programming FixedPoint Semantics

» One useful logic that defines its own truth

» Logical Aggregation Based on Interpolative Realization of Boolean Algebra

» Two Forms of Dependence in Propositional Logic Controllability and Definability

» An Ordinal Bargaining Solution with FixedPoint Property

» Affine Systems of Equations and Counting Infinitary Logic

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	AIML
Authors	Carlos Areces, Eva Hoogland, Dick de Jongh

Comments (0)

Sciweavers

Interpolation, Definability and Fixed Points in Interpretability Logics

AIML 1998 | AIML 2008 | Arrow Interpolation | Fixed Point | Interpolation |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers