Results 151 to 160 of about 1,478 (181)

A Note on Linear Kripke Models

Journal of Logic and Computation, 2005
Summary: Gödel logics correspond to linear models with constant domains. In this paper other truth-value logics, Scott logics, are defined, that correspond to linear models with possibly non-constant domains. An extension of intuitionistic logic with an existence predicate is discussed, and it is shown that this provides a natural translation of Scott ...
openaire   +2 more sources

Modelling uncertainty with kripke's semantics

1998
The set of possible worlds of any model of modal logic can be endowed with evidence measures, by considering the accessibility relation as a multivalued mapping. The measures induced by the model itself can then be expressed in terms of these measures.
Veselka Boeva, Elena Tsiporkova, Bernard De Baets   +2 more
openaire   +1 more source

Some Operators in Kripke Models with an Involution

Journal of Applied Non-Classical Logics, 1999
ABSTRACT In an unpublished paper(see [9]), we prove the equivalence between validity in 3L-models and algebraic validity in 3-valued Lukasiewicz algebras. R. Cignoli and M. Sagastume de Gallego present in [4] an intrinsic definition of the operators s, for i = 1,…,4 of a 5-valued Lukasiewicz algebra.
Adriana Galli, Marta Sagastume
openaire   +1 more source

Constants in Kripke Models for Intuitionistic Logic

Mathematical Logic Quarterly, 1995
AbstractWe present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary extension satisfying some property (cardinality, saturation, etc.) which can be “axiomatized” by a family of sets of sentences, where, most often, many constant symbols occur. To that end, we prove extended theorems of completeness and compactness.
openaire   +2 more sources

Corrigendum to “Weak Arithmetics and Kripke Models”

Mathematical Logic Quarterly, 2004
AbstractWe give a corrected proof of the main result in the paper [2] mentioned in the title. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
openaire   +1 more source

Kripke Models, Distributive Lattices, and Medvedev Degrees

Studia Logica, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Kripke Models Built from Models of Arithmetic

2015
We introduce three relations between models of Peano Arithmetic $$\mathsf {PA}$$, each of which is characterized as an arithmetical accessibility relation. A relation $$\mathrel {R}$$ is said to be an arithmetical accessibility relation if for any model $$\mathcal {M}$$ of $$\mathsf {PA}$$, $$\mathcal {M}\vDash \mathsf {Pr}_{\pi }\varphi $$ iff ...
openaire   +1 more source

On the duality of dynamic algebras and kripke models

1981
We introduce a natural topology on Kripke models of propositional dynamic logic (PDL) and exhibit a useful duality between certain topological Kripke models and separable dynamic algebras analogous to the duality between Boolean algebras and their Stone spaces.
openaire   +1 more source

Finite Kripke models of HA are locally PA

Notre Dame J. Formal Log., 1986
In a Kripke model for Heyting arithmetic the nodes carry classical models of (subsystems of) Peano arithmetic. It is not known which theories hold for these local models in general. In the present paper it is established that in finite Kripke models the local models are models of full Peano arithmetic.
van Dalen, D. V., Mulder, H., Krabbe, E. C.W., Visser, A.   +3 more
openaire   +1 more source

Constructions of classical models by means of Kripke models (survey)

Studia Logica, 1979
It is demonstrated how Kripke models for intuitionistic predicate logic can be applied in order to prove classical theorems. As examples proofs of the independence of the axiom of constructibility, of the omitting types theorem and of Shelah's ultrapower theorem are sketched.
openaire   +2 more sources