Search

Your search keyword '"KRIPKE semantics"' showing total 3 results
3 results on '"KRIPKE semantics"'

1. A NEW SEMANTIC FRAMEWORK FOR MODAL LOGIC.

Author

PUNČOCHÁŘ, VÍT

Subjects
*SEMANTICS, *BOOLEAN algebra, *ALGEBRAIC logic, *ALGEBRAIC geometry, *GEOMETRY
Abstract

The article presents a new semantic framework for modal propositional language. The basic structures of the semantics are Boolean algebras with operators. However, the semantics is not algebraic but rather relational; in it, Boolean algebras with operators play a similar role as Kripke models in standard relational semantics, and the semantics is based on a relation between the elements of Boolean algebras enriched with operators and formulas from modal language. Some basic connections between the new semantic framework and standard algebraic and relational semantics are studied. [ABSTRACT FROM AUTHOR]

Published
2014

2. Basic Core Fuzzy Logics and Algebraic Routley–Meyer-Style Semantics.

Author

Yang, Eunsuk

Subjects
*ALGEBRAIC logic, *SEMANTICS, *KRIPKE semantics, *LOGIC
Abstract

Recently, algebraic Routley–Meyer-style semantics was introduced for basic substructural logics. This paper extends it to fuzzy logics. First, we recall the basic substructural core fuzzy logic MIAL (Mianorm logic) and its axiomatic extensions, together with their algebraic semantics. Next, we introduce two kinds of ternary relational semantics, called here linear Urquhart-style and Fine-style Routley–Meyer semantics, for them as algebraic Routley–Meyer-style semantics. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

3. A unifying theorem for algebraic semantics and dynamic logics

Author

Hajnal Andréka, István Németi, Irène Guessarian, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), and Guessarian, Irene

Subjects
Correctness, Computer science, Semantics (computer science), 02 engineering and technology, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Monoidal t-norm logic, Computer Science::Logic in Computer Science, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Algebra over a field, Principle of bivalence, Mathematics, Discrete mathematics, Mathematical logic, Classical logic, 010102 general mathematics, Ultraproduct, 16. Peace & justice, Algebraic logic, Computer Science Applications, Algebra, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Algebraic semantics, Computational Theory and Mathematics, 010201 computation theory & mathematics, Computer Science::Programming Languages, 020201 artificial intelligence & image processing, Kripke semantics, T-norm fuzzy logics, Partially ordered set, Information Systems
Abstract

A unified single proof is given which implies theorems in such diverse fields as continuous algebras of algebraic semantics, dynamic algebras of logics of programs, and program verification methods for total correctness. The proof concerns ultraproducts and diagonalization.

Published
1987

Catalog

Books, media, physical & digital resources
See catalog results