Results 11 to 20 of about 46 (36)

Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic [PDF]

Logical Methods in Computer Science
A system $\boldsymbolλ_θ$ is developed that combines modal logic and simply-typed lambda calculus, and that generalizes the system studied by Montague and Gallin.
Sean Walsh
doaj   +1 more source

The McKinsey–Lemmon logic is barely canonical [PDF]

, 2006
We study a canonical modal logic introduced by Lemmon, and axiomatised by an infinite sequence of axioms generalising McKinsey’s formula. We prove that the class of all frames for this logic is not closed under elementary equivalence, and so is non ...
Goldblatt, Robert, Robert Goldblatt, Ian Hodkinson, Hodkinson, Ian   +3 more
core  

Geometrical representation theorems for cylindric-type algebras

, 2020
In this paper, we give new proofs of the celebrated Andréka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order logic, that can ...
Ahmed, Tarek Sayed, Khaled, Mohamed
core  

CCS with Hennessy's merge has no finite equational axiomatization [PDF]

, 2004
This paper confirms a conjecture of Bergstra and Klop¿s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner¿s Calculus of Communicationg Systems
Fokkink, W.J. (Wan), Luttik, S.P. (Bas), Luttik, SP Bas, Ingólfsdóttir, A, Aceto, L. (Luca), Aceto, L, Ingólfsdóttir, A., Fokkink, WJ Wan   +7 more
core  

Sistemas multi–modales de profundidad restringida

Ingeniería y Ciencia, 2008
Se presentan como extensiones del cálculo proposicional clásico, la jerarquíade sistemas deductivos SMM–n con n > 1. SMM–n es el sistema multi–modalde profundidad–n. El sistema SMM–1 es el cálculo proposicional clásico.
Manuel Sierra A.
doaj  

A Modal Logic of Quantification and Substitution [PDF]

, 1993
. The aim of this paper is to study the n-variable fragment of first order logic from a modal perspective. We define a modal formalism called cylindric mirror modal logic, and show how it is a modal version of first order logic with substitution.
Yde Venema, Venema, Y.
core  

Lógicas epistémica y doxástica con restricciones

Ingeniería y Ciencia, 2010
Se presentan como extensiones del cálculo proposicional clásico las jerarquías de sistemas deductivos LER–n y LDR–n, con n ≥ 1. LER–n es la Lógica epistémica con restricciones de profundidad–n, LDR–n es la Lógica doxástica con restricciones de ...
Manuel Sierra A.
doaj  

Abstract On Modal Logic of Deductive Closure

, 2008
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be decidable and complete with respect to this semantics.
Pavel Naumov
core  

All finitely axiomatizable subframe logics containing the provability logic CSM0 are decidable

, 1997
In this paper we investigate those extensions of the bimodal provability logic CSM 0 (alias PRL 1 or F \Gamma ) which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are
Alias Prl Or F, Frank Wolter
core  

A Modal Logic for Quantification and Substitution

, 1994
The aim of this paper is to study the n-variable fragment of first order logic from a modal perspective. We define a modal formalism called cylindric mirror modal logic, and show how it is a modal version of first order logic with substitution.
Faculteit Wiskunde En Informatica, Yde Venema   +1 more
core