Displaying similar documents to “Kripke models and manivalued logics, II”

Algebraic axiomatization of tense intuitionistic logic

Ivan Chajda (2011)

Open Mathematics

Similarity:

We introduce two unary operators G and H on a relatively pseudocomplemented lattice which form an algebraic axiomatization of the tense quantifiers “it is always going to be the case that” and “it has always been the case that”. Their axiomatization is an extended version for the classical logic and it is in accordance with these operators on many-valued Łukasiewicz logic. Finally, we get a general construction of these tense operators on complete relatively pseudocomplemented lattice...

Towards specifying with inclusions.

Jaume Agustí, Jordi Puigsegur, W. Marco Schorlemmer (1997)

Mathware and Soft Computing

Similarity:

In this article we present a functional specification language based on inclusions between set expressions. Instead of computing with data individuals we deal with their classification into sets. The specification of functions and relations by means of inclusions can be considered as a generalization of the conventional algebraic specification by means of equations. The main aim of this generalization is to facilitate the incremental refinement of specifications. Furthermore, inclusional...

Four-valued expansions of Dunn-Belnap's logic (I): Basic characterizations

Alexej P. Pynko (2020)

Bulletin of the Section of Logic

Similarity:

Basic results of the paper are that any four-valued expansion L4 of Dunn-Belnap's logic DB4 is de_ned by a unique (up to isomorphism) conjunctive matrix ℳ4 with exactly two distinguished values over an expansion 𝔄4 of a De Morgan non-Boolean four-valued diamond, but by no matrix with either less than four values or a single [non-]distinguished value, and has no proper extension satisfying Variable Sharing Property (VSP). We then characterize L4's having a theorem / inconsistent formula,...

A Syntactic Approach to Closure Operation

Marek Nowak (2017)

Bulletin of the Section of Logic

Similarity:

In the paper, tracing the traditional Hilbert-style syntactic account of logics, a syntactic characteristic of a closure operation defined on a complete lattice follows. The approach is based on observation that the role of rule of inference for a given consequence operation may be played by an ordinary binary relation on the complete lattice on which the closure operation is defined.

From two- to four-valued logic

Chris Brink (1993)

Banach Center Publications

Similarity:

The purpose of this note is to show that a known and natural four-valued logic co-exists with classical two-valued logic in the familiar context of truth tables. The tool required is the power construction.