Results 221 to 230 of about 102,741 (269)

Predicate Logical Extensions of some Subintuitionistic Logics

Studia Logica, 2009
The paper presents predicate logical extensions of some subintuitionistic logics. Subintuitionistic logics result if conditions of the accessibility relation in Kripke models for intuitionistic logic are dropped. The accessibility relation which interprets implication in models for the propositional base subintuitionistic logic considered here is ...
Ernst Zimmermann
openaire   +3 more sources

A Note on Disjunction and Existence Properties in Predicate Extensions of Intuitionistic Logic—An Application of Jankov Formulas to Predicate Logics

, 2022
Norihiro Suzuki
openaire   +2 more sources

Extension of results to arbitrary formalisms of predicate logic, and applications to the formalization of the arithmetics of natural and real numbers

, 1987
Alfred Tarski, Steven Givant
openaire   +2 more sources

Expressivity of extensions of dynamic predicate logic

, 2001
ten Cate, B.D., van Eijck, J., Heguiabehere, J.M.   +2 more
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

A Van Benthem/Rosen theorem for coalgebraic predicate logic

Journal of Logic and Computation, 2015
A BSTRACT . Coalgebraic modal logic serves as a unifying framework to study a wide range of modal logics beyond the relational realm, including probabilistic and graded logics as well as conditional logics and logics based on neighbourhoods and games ...
Lutz Schröder, D. Pattinson, Tadeusz Litak   +2 more
semanticscholar   +1 more source

Regular Expressions and Predicate Logic in Finite-State Language Processing

Finite-State Methods and Natural Language Processing, 2009
This paper proposes an extension to the formalism of regular expressions with a form of predicate logic where quantified propositions apply to substrings.
Mans Hulden
semanticscholar   +1 more source

The Effects of Adding Reachability Predicates in Propositional Separation Logic

Foundations of Software Science and Computation Structure, 2018
The list segment predicate \(\mathtt {ls}\) used in separation logic for verifying programs with pointers is well-suited to express properties on singly-linked lists.
Stephane Demri, É. Lozes, Alessio Mansutti   +2 more
semanticscholar   +1 more source

A Modal Logic of a Truth Definition for Finite Models

Fundamenta Informaticae, 2019
The property of being true in almost all finite, initial segments of the standard model of arithmetic is ∑ 2 0 –complete. Thus, it admits a kind of a truth definition. We define such an arithmetical predicate. Then, we define its modal logic SL and prove
M. Czarnecki, K. Zdanowski
semanticscholar   +1 more source

A Simple Logic of Concepts

Journal of Philosophical Logic, 2022
Thomas F. Icard, L. Moss
semanticscholar   +1 more source

A completeness theorem for continuous predicate modal logic

Archive for Mathematical Logic, 2019
S. Baratella
semanticscholar   +1 more source