General frame

Last updated

In logic, general frames (or simply frames) are Kripke frames with an additional structure, which are used to model modal and intermediate logics. The general frame semantics combines the main virtues of Kripke semantics and algebraic semantics: it shares the transparent geometrical insight of the former, and robust completeness of the latter.

Contents

Definition

A modal general frame is a triple , where is a Kripke frame (i.e., is a binary relation on the set ), and is a set of subsets of that is closed under the following:

They are thus a special case of fields of sets with additional structure. The purpose of is to restrict the allowed valuations in the frame: a model based on the Kripke frame is admissible in the general frame , if

for every propositional variable .

The closure conditions on then ensure that belongs to for every formula (not only a variable).

A formula is valid in , if for all admissible valuations , and all points . A normal modal logic is valid in the frame , if all axioms (or equivalently, all theorems) of are valid in . In this case we call an -frame.

A Kripke frame may be identified with a general frame in which all valuations are admissible: i.e., , where denotes the power set of .

Types of frames

In full generality, general frames are hardly more than a fancy name for Kripke models; in particular, the correspondence of modal axioms to properties on the accessibility relation is lost. This can be remedied by imposing additional conditions on the set of admissible valuations.

A frame is called

Kripke frames are refined and atomic. However, infinite Kripke frames are never compact. Every finite differentiated or atomic frame is a Kripke frame.

Descriptive frames are the most important class of frames because of the duality theory (see below). Refined frames are useful as a common generalization of descriptive and Kripke frames.

Operations and morphisms on frames

Every Kripke model induces the general frame , where is defined as

The fundamental truth-preserving operations of generated subframes, p-morphic images, and disjoint unions of Kripke frames have analogues on general frames. A frame is a generated subframe of a frame , if the Kripke frame is a generated subframe of the Kripke frame (i.e., is a subset of closed upwards under , and ), and

A p-morphism (or bounded morphism) is a function from to that is a p-morphism of the Kripke frames and , and satisfies the additional constraint

for every .

The disjoint union of an indexed set of frames , , is the frame , where is the disjoint union of , is the union of , and

The refinement of a frame is a refined frame defined as follows. We consider the equivalence relation

and let be the set of equivalence classes of . Then we put

Completeness

Unlike Kripke frames, every normal modal logic is complete with respect to a class of general frames. This is a consequence of the fact that is complete with respect to a class of Kripke models : as is closed under substitution, the general frame induced by is an -frame. Moreover, every logic is complete with respect to a single descriptive frame. Indeed, is complete with respect to its canonical model, and the general frame induced by the canonical model (called the canonical frame of ) is descriptive.

Jónsson–Tarski duality

The Rieger-Nishimura ladder: a 1-universal intuitionistic Kripke frame. Rieger-Nishimura ladder.svg
The Rieger–Nishimura ladder: a 1-universal intuitionistic Kripke frame.
Its dual Heyting algebra, the Rieger-Nishimura lattice. It is the free Heyting algebra over 1 generator. Rieger-Nishimura.svg
Its dual Heyting algebra, the Rieger–Nishimura lattice. It is the free Heyting algebra over 1 generator.

General frames bear close connection to modal algebras. Let be a general frame. The set is closed under Boolean operations, therefore it is a subalgebra of the power set Boolean algebra . It also carries an additional unary operation, . The combined structure is a modal algebra, which is called the dual algebra of , and denoted by .

In the opposite direction, it is possible to construct the dual frame to any modal algebra . The Boolean algebra has a Stone space, whose underlying set is the set of all ultrafilters of . The set of admissible valuations in consists of the clopen subsets of , and the accessibility relation is defined by

for all ultrafilters and .

A frame and its dual validate the same formulas; hence the general frame semantics and algebraic semantics are in a sense equivalent. The double dual of any modal algebra is isomorphic to itself. This is not true in general for double duals of frames, as the dual of every algebra is descriptive. In fact, a frame is descriptive if and only if it is isomorphic to its double dual .

It is also possible to define duals of p-morphisms on one hand, and modal algebra homomorphisms on the other hand. In this way the operators and become a pair of contravariant functors between the category of general frames, and the category of modal algebras. These functors provide a duality (called Jónsson–Tarski duality after Bjarni Jónsson and Alfred Tarski) between the categories of descriptive frames, and modal algebras. This is a special case of a more general duality between complex algebras and fields of sets on relational structures.

Intuitionistic frames

The frame semantics for intuitionistic and intermediate logics can be developed in parallel to the semantics for modal logics. An intuitionistic general frame is a triple , where is a partial order on , and is a set of upper subsets (cones) of that contains the empty set, and is closed under

Validity and other concepts are then introduced similarly to modal frames, with a few changes necessary to accommodate for the weaker closure properties of the set of admissible valuations. In particular, an intuitionistic frame is called

Tight intuitionistic frames are automatically differentiated, hence refined.

The dual of an intuitionistic frame is the Heyting algebra . The dual of a Heyting algebra is the intuitionistic frame , where is the set of all prime filters of , the ordering is inclusion, and consists of all subsets of of the form

where . As in the modal case, and are a pair of contravariant functors, which make the category of Heyting algebras dually equivalent to the category of descriptive intuitionistic frames.

It is possible to construct intuitionistic general frames from transitive reflexive modal frames and vice versa, see modal companion.

Related Research Articles

<span class="mw-page-title-main">Inner product space</span> Generalization of the dot product; used to define Hilbert spaces

In mathematics, an inner product space is a real vector space or a complex vector space with an operation called an inner product. The inner product of two vectors in the space is a scalar, often denoted with angle brackets such as in . Inner products allow formal definitions of intuitive geometric notions, such as lengths, angles, and orthogonality of vectors. Inner product spaces generalize Euclidean vector spaces, in which the inner product is the dot product or scalar product of Cartesian coordinates. Inner product spaces of infinite dimension are widely used in functional analysis. Inner product spaces over the field of complex numbers are sometimes referred to as unitary spaces. The first usage of the concept of a vector space with an inner product is due to Giuseppe Peano, in 1898.

<span class="mw-page-title-main">Saul Kripke</span> American philosopher and logician (1940–2022)

Saul Aaron Kripke was an American analytic philosopher and logician. He was Distinguished Professor of Philosophy at the Graduate Center of the City University of New York and emeritus professor at Princeton University. Kripke is considered one of the most important philosophers of the latter half of the 20th century. Since the 1960s, he has been a central figure in a number of fields related to mathematical and modal logic, philosophy of language and mathematics, metaphysics, epistemology, and recursion theory.

<span class="mw-page-title-main">De Morgan's laws</span> Pair of logical equivalences

In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathematician. The rules allow the expression of conjunctions and disjunctions purely in terms of each other via negation.

Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems of intuitionistic logic do not assume the law of the excluded middle and double negation elimination, which are fundamental inference rules in classical logic.

Relevance logic, also called relevant logic, is a kind of non-classical logic requiring the antecedent and consequent of implications to be relevantly related. They may be viewed as a family of substructural or modal logics. It is generally, but not universally, called relevant logic by British and, especially, Australian logicians, and relevance logic by American logicians.

In mathematics, a linear form is a linear map from a vector space to its field of scalars.

In mathematics, the Hodge star operator or Hodge star is a linear map defined on the exterior algebra of a finite-dimensional oriented vector space endowed with a nondegenerate symmetric bilinear form. Applying the operator to an element of the algebra produces the Hodge dual of the element. This map was introduced by W. V. D. Hodge.

Modal logic is a kind of logic used to represent statements about necessity and possibility. It plays a major role in philosophy and related fields as a tool for understanding concepts such as knowledge, obligation, and causation. For instance, in epistemic modal logic, the formula can be used to represent the statement that is known. In deontic modal logic, that same formula can represent that is a moral obligation. Modal logic considers the inferences that modal statements give rise to. For instance, most epistemic logics treat the formula as a tautology, representing the principle that only true statements can count as knowledge.

In mathematical logic and computer science, the calculus of constructions (CoC) is a type theory created by Thierry Coquand. It can serve as both a typed programming language and as constructive foundation for mathematics. For this second reason, the CoC and its variants have been the basis for Coq and other proof assistants.

In mathematical logic, a superintuitionistic logic is a propositional logic extending intuitionistic logic. Classical logic is the strongest consistent superintuitionistic logic; thus, consistent superintuitionistic logics are called intermediate logics.

Kripke semantics is a formal semantics for non-classical logic systems created in the late 1950s and early 1960s by Saul Kripke and André Joyal. It was first conceived for modal logics, and later adapted to intuitionistic logic and other non-classical systems. The development of Kripke semantics was a breakthrough in the theory of non-classical logics, because the model theory of such logics was almost non-existent before Kripke.

In modal logic, Sahlqvist formulas are a certain kind of modal formula with remarkable properties. The Sahlqvist correspondence theorem states that every Sahlqvist formula is canonical, and corresponds to a first-order definable class of Kripke frames.

In abstract algebra, an interior algebra is a certain type of algebraic structure that encodes the idea of the topological interior of a set. Interior algebras are to topology and the modal logic S4 what Boolean algebras are to set theory and ordinary propositional logic. Interior algebras form a variety of modal algebras.

In mathematics, a field of sets is a mathematical structure consisting of a pair consisting of a set and a family of subsets of called an algebra over that contains the empty set as an element, and is closed under the operations of taking complements in finite unions, and finite intersections.

In logic, a rule of inference is admissible in a formal system if the set of theorems of the system does not change when that rule is added to the existing rules of the system. In other words, every formula that can be derived using that rule is already derivable without that rule, so, in a sense, it is redundant. The concept of an admissible rule was introduced by Paul Lorenzen (1955).

In linear algebra, a frame of an inner product space is a generalization of a basis of a vector space to sets that may be linearly dependent. In the terminology of signal processing, a frame provides a redundant, stable way of representing a signal. Frames are used in error detection and correction and the design and analysis of filter banks and more generally in applied mathematics, computer science, and engineering.

In logic, a modal companion of a superintuitionistic (intermediate) logic L is a normal modal logic that interprets L by a certain canonical translation, described below. Modal companions share various properties of the original intermediate logic, which enables to study intermediate logics using tools developed for modal logic.

In logic and philosophy, S5 is one of five systems of modal logic proposed by Clarence Irving Lewis and Cooper Harold Langford in their 1932 book Symbolic Logic. It is a normal modal logic, and one of the oldest systems of modal logic of any kind. It is formed with propositional calculus formulas and tautologies, and inference apparatus with substitution and modus ponens, but extending the syntax with the modal operator necessarily and its dual possibly.

In algebra and logic, a modal algebra is a structure such that

In logic, philosophy, and theoretical computer science, dynamic logic is an extension of modal logic capable of encoding properties of computer programs.

References