Results 11 to 20 of about 101,814 (276)
Mendler-style Iso-(Co)inductive predicates: a strongly normalizing approach [PDF]
Electronic Proceedings in Theoretical Computer Science, 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.
Favio Ezequiel Miranda-Perea +1 more
doaj +4 more sources
IMPLICITINĖ PREDIKATO KVANTIFIKACIJA IR PORT ROYALIO LOGIKA
Problemos, 2004 Straipsnyje analizuojama logikos istorikų Jill Vance Buroker, Sylvaino Auroux ir Jeano-Claude’o Pariente’o pozicija, kad tradicinės logikos pradininkų – Antoine’o Arnauld ir Pierre’o Nicole’io – pažiūrose į kategorinio sakinio semantiką galima įžvelgti ...
Laisvūnas Šopauskas
doaj +24 more sources
An extension of intermediate predicate logics to higher order
Japanese journal of mathematics. New series, 1991 Toshio Umezawa
openaire +4 more sources
KATEGORINIŲ SAKINIŲ SEMANTIKA PORT ROYALIO LOGIKOJE
Problemos, 2004 Straipsnyje analizuojamos tradicinės logikos pradininkų – Antoine’o Arnauld ir Pierre’o Nicole’io – pažiūros į kategorinio sakinio semantiką trimis aspektais: kaip jie suprato sintaksę, elementariųjų dalių prasmes ir sakinio prasmės priklausomybę nuo ...
Laisvūnas Šopauskas
doaj +24 more sources
A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value [PDF]
Notre Dame Journal of Formal Logic, 2021 We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined.
A. Valmari, L. Hella
semanticscholar +1 more source
Definite descriptions and hybrid tense logic [PDF]
Synthese, 2023 We provide a version of first-order hybrid tense logic with predicate abstracts and definite descriptions as the only non-rigid terms. It is formalised by means of a tableau calculus working on sat-formulas.
Andrzej Indrzejczak, Michał Zawidzki
semanticscholar +1 more source
An Arithmetically Complete Predicate Modal Logic
Bulletin of the Section of Logic, 2021 This paper investigates a first-order extension of GL called \(\textup{ML}^3\). We outline briefly the history that led to \(\textup{ML}^3\), its key properties and some of its toolbox: the \emph{conservation theorem}, its cut-free Gentzenisation, the ...
G. Tourlakis, Yunge Hao
semanticscholar +1 more source
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes [PDF]
arXiv.org, 2022 The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (FOL) with the extra atomic predicate $\mathsf{dp}_k(x_1,y_1,\ldots,x_k,y_k),$ expressing the existence of internally vertex-disjoint paths between $x_i$ and $y_i,$ for $i\in\{1 ...
P. Golovach +2 more
semanticscholar +1 more source
Predicate Abstraction via Symbolic Decision Procedures [PDF]
Logical Methods in Computer Science, 2007 We present a new approach for performing predicate abstraction based on symbolic decision procedures. Intuitively, a symbolic decision procedure for a theory takes a set of predicates in the theory and symbolically executes a decision procedure on all ...
Shuvendu K. Lahiri +2 more
doaj +1 more source
Intuitionistic Layered Graph Logic: Semantics and Proof Theory [PDF]
Logical Methods in Computer Science, 2018 Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature.
Simon Docherty, David Pym
doaj +1 more source