1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Detalles del recurso

Descripción

There are two known general results on the finite model property (fmp) of commutators $[L_{0},L_{1}]$ (bimodal logics with commuting and confluent modalities). If $L$ is finitely axiomatizable by modal formulas having universal Horn first-order correspondents, then both $[L,\mathbf{K}]$ and $[L,\mathbf{S5}]$ are determined by classes of frames that admit filtration, and so they have the fmp. On the negative side, if both $L_{0}$ and $L_{1}$ are determined by transitive frames and have frames of arbitrarily large depth, then $[L_{0},L_{1}]$ does not have the fmp. In this paper we show that commutators with a “weakly connected” component often lack the fmp. Our results imply that the above positive result does not generalize to universally axiomatizable component logics, and even commutators without “transitive” components such as $[\mathbf{K3},\mathbf{K}]$ can lack the fmp. We also generalize the above negative result to cases where one of the component logics has frames of depth one only, such as $[\mathbf{S4.3},\mathbf{S5}]$ and the decidable product logic $\mathbf{S4.3}\!\times\!\mathbf{S5}$ . We also show cases when already half of commutativity is enough to force infinite frames.

Pertenece a

Project Euclid (Hosted at Cornell University Library)  

Autor(es)

Kurucz, Agi - 

Id.: 69790186

Idioma: inglés  - 

Versión: 1.0

Estado: Final

Tipo:  application/pdf - 

Palabras clavemultimodal logic - 

Tipo de recurso: Text  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Copyright 2017 University of Notre Dame

Formatos:  application/pdf - 

Requerimientos técnicos:  Browser: Any - 

Relación: [References] 0029-4527
[References] 1939-0726

Fecha de contribución: 16-abr-2017

Contacto:

Localización:
* Notre Dame J. Formal Logic 58, no. 2 (2017), 287-299
* doi:10.1215/00294527-3870247

Otros recursos del mismo autor(es)

  1. Non-finitely axiomatisable two-dimensional modal logics We show the first examples of recursively enumerable (even decidable) two-dimensional products of fi...
  2. Products of ‘transitive’ modal logics We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal lo...
  3. Undecidability of first-order intuitionistic and modal logics with two variables We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even wit...

Otros recursos de la mismacolección

  1. On Polynomial-Time Relation Reducibility We study the notion of polynomial-time relation reducibility among computable equivalence relations....
  2. Infinite Computations with Random Oracles We consider the following problem for various infinite-time machines. If a real is computable relati...
  3. Why Intuitionistic Relevant Logic Cannot Be a Core Logic At the end of the 1980s, Tennant invented a logical system that he called “intuitionistic relevant l...
  4. Dunn–Priest Quotients of Many-Valued Structures J. Michael Dunn’s Theorem in 3-Valued Model Theory and Graham Priest’s Collapsing Lemma provide the ...
  5. Normal Numbers and Limit Computable Cantor Series Given any oracle, $A$ , we construct a basic sequence $Q$ , computable in the jump of $A$ , such tha...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.