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 que te pueden interesar

  1. Study of mtDNA variation of Russian sturgeon population from the south Caspian Sea using RFLP analysis of PCR amplified ND5/6 gene regions PCR-based mtDNA analysis (RFLP) was used for the study of population differentiation in the Russian ...
  2. A preliminary study on phylogenetic relationship between five sturgeon species in the Iranian coastline of the Caspian Sea The phylogenetic relationship of five sturgeon species in the South Caspian Sea was investigated usi...
  3. An investigation on the micropyle number in the ova of the strugeon species in Caspian Sea The micropyle number in the ova of sturgeon species from the South Caspian Sea was investigated. The...
  4. Teaching with VR. Développer des environnements virtuels au service de l’enseignement en sciences humaines et sociales L’élaboration d’environnements de réalité virtuelle requiert des compétences pluridisciplinaires. A ...
  5. The Republic of Kosovo: 10 years of independence

Otros recursos de la mismacolección

  1. Errata
  2. Invariance and Definability, with and without Equality The dual character of invariance under transformations and definability by some operations has been ...
  3. On the Jumps of the Degrees Below a Recursively Enumerable Degree We consider the set of jumps below a Turing degree, given by $\mathsf{JB}(\mathbf{a})=\{\mathbf{x}':...
  4. Negation-Free and Contradiction-Free Proof of the Steiner–Lehmus Theorem By rephrasing quantifier-free axioms as rules of derivation in sequent calculus, we show that the ge...
  5. Cardinality and Acceptable Abstraction It is widely thought that the acceptability of an abstraction principle is a feature of the cardinal...

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.