Skoči na glavni sadržaj

Rad Hrvatske akademije znanosti i umjetnosti. Matematičke znanosti, No. 519=18, 2014.

Izvorni znanstveni članak

Interpretability logic IL does not have finite subtree property

Vedran Čačić orcid id orcid.org/0000-0003-2330-9740 ; Department of Mathematics, University of Zagreb, Zagreb, Croatia
Mladen Vuković orcid id orcid.org/0000-0002-3829-9859 ; Department of Mathematics, University of Zagreb, Zagreb, Croatia

Puni tekst: engleski pdf 148 Kb

str. 1-5

preuzimanja: 724

citiraj

Sažetak

Usually, when a logic has finite model property (fmp), it
also has a stronger, finite submodel property: every model can be reduced to a finite submodel. Or, at least, it has a finite subtree property, which is restricted to models that are trees. We prove that interpretability logic IL does not have finite subtree property.

Ključne riječi

Interpretability logic; Veltman models; finite model property

Hrčak ID:

127633

URI

https://hrcak.srce.hr/127633

Datum izdavanja:

30.9.2014.

Posjeta: 1.426 *