Results 11 to 20 of about 63,358 (127)
Categorical and Algebraic Aspects of the Intuitionistic Modal Logic $\operatorname{IEL}^{-}$ and its predicate extensions [PDF]
, 2022 Daniel Rogozin
openalex +2 more sources
Introducing Quantified Cuts in Logic with Equality
, 2014 Cut-introduction is a technique for structuring and compressing formal proofs. In this paper we generalize our cut-introduction method for the introduction of quantified lemmas of the form $\forall x.A$ (for quantifier-free $A$) to a method generating ...
Hetzl, Stefan +4 more
core +2 more sources
Continuous first order logic and local stability [PDF]
, 2008 We develop continuous first order logic, a variant of the logic described in \cite{Chang-Keisler:ContinuousModelTheory}. We show that this logic has the same power of expression as the framework of open Hausdorff cats, and as such extends Henson's logic ...
Usvyatsov, Alexander, Yaacov, Itaï Ben
core +5 more sources
Mendler-style Iso-(Co)inductive predicates: a strongly normalizing approach
, 2012 We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles.
Elaine Pimentel +3 more
core +2 more sources
An extension of Jónsson-Tarski representation and model existence in predicate non-normal modal logics [PDF]
, 2022 Yoshihito Tanaka
openalex +2 more sources
Refinement Calculus of Reactive Systems
, 2014 Refinement calculus is a powerful and expressive tool for reasoning about sequential programs in a compositional manner. In this paper we present an extension of refinement calculus for reactive systems.
Preoteasa, Viorel, Tripakis, Stavros
core +1 more source
Anticipation as prediction in the predication of data types [PDF]
, 2009 Every object in existence has its type. Every subject in language has its predicate. Every intension in logic has its extension. Each therefore has two levels but with the fundamental problem of the relationship between the two.
Heather, Michael, Rossiter, Nick
core
, 2016 Quantified Boolean formulas (QBFs) generalize propositional formulas by admitting quantifications over propositional variables. QBFs can be viewed as (restricted) formulas of first-order predicate logic and easy translations of QBFs into first-order ...
Egly, Uwe
core +2 more sources
Offline Specialisation in Prolog Using a Hand-Written Compiler Generator
, 2004 The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evaluation of both functional and imperative languages.
Bruynooghe, Maurice +3 more
core +1 more source
Theories of truth for countable languages which conform to classical logic [PDF]
Every countable language which conforms to classical logic is shown to have an extension which has a consistent definitional theory of truth. That extension has a consistent semantical theory of truth, if every sentence of the object language is ...
Heikkilä, Seppo
core