Mutual recursion

Mutual recursion

M

Published in Phillip A. Laplante, Dictionary of Computer Science, Engineering, and Technology, 2017

mutual recursion a situation in which two functions call each other, for example, function A calls function B, and function B calls function A. This usually requires, in most languages, a forward declaration of one of the functions.

Lattice logic as a fragment of (2-sorted) residuated modal logic

View Article

Journal Information

Published in Journal of Applied Non-Classical Logics, 2019

Chrysafis Hartonas

For classical modal logic, correspondence theory is based on the simple observation that models on Kripke frames , can be regarded either as models of modal logics, or as models of a first-order language with equality and a binary predicate R. Two-sorted frames , where , arise as a natural relational framework to provide semantics to non-distributive logics with operators Gehrke (2006), Hartonas (2018a, 2018d), Hartonas and Orlowska (2017), Suzuki (2010). Models on these frames are equipped with an interpretation V of propositional variables in some countable, non-empty set P, assigning to each a stable subset with respect to the Galois connection generated by , where by stability we mean the property of a subset A of X that . For non-distributive logics, a co-interpretation also arises, defined by , and interpretation and co-interpretation are extended by mutual recursion to all sentences.

Explore chapters and articles related to this topic

M

Lattice logic as a fragment of (2-sorted) residuated modal logic