Results 31 to 40 of about 201,623 (302)
Topological Completeness for Higher-Order Logic [PDF]
Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces - so-called "topological semantics". The first is classical higher order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with ...
Steven Awodey, Carsten Butz
openaire +5 more sources
CIFOL: Case-intensional first order logic. (I) Toward a theory of sorts [PDF]
This is Part I of a two-part essay introducing case-intensional first-order logic (CIFOL), an easy-to-use, uniform, powerful, and useful combination of first order logic with modal logic resulting from philosophical and technical modifications of Bressan’
Nuel Belnap +3 more
core +1 more source
Light Logics and Higher-Order Processes [PDF]
We show that the techniques for resource control that have been developed by the so-calledlight logicscan be fruitfully applied also to process algebras. In particular, we present a restriction of higher-order π-calculus inspired by soft linear logic. We prove that any soft process terminates in polynomial time.
DAL LAGO, UGO +2 more
openaire +5 more sources
Log-Linear-Based Logic Mining with Multi-Discrete Hopfield Neural Network
Choosing the best attribute from a dataset is a crucial step in effective logic mining since it has the greatest impact on improving the performance of the induced logic.
Gaeithry Manoharam +6 more
doaj +1 more source
Expressibility of Higher Order Logics
AbstractWe study the expressive power of higher order logics on finite relational structures or databases. First, we give a characterization of the expressive power of the fragments Σij and πij, for each order i ≥ 2 and each number of alternations of quantifier blocks j. Then we get as a corollary the expressive power of HOi for each order i ≥ 2.
Lauri Hella, Jose Maria Turull Torres
openaire +1 more source
Higher-Order Logic and Disquotational Truth
AbstractTruth predicates are widely believed to be capable of serving a certain logical or quasi-logical function. There is little consensus, however, on the exact nature of this function. We offer a series of formal results in support of the thesis that disquotational truth is a device to simulate higher-order resources in a first-order setting.
Lavinia María Picollo +1 more
openaire +2 more sources
A Functional (Monadic) Second-Order Theory of Infinite Trees [PDF]
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results concerning the ...
Anupam Das, Colin Riba
doaj +1 more source
Language and Proofs for Higher-Order SMT (Work in Progress) [PDF]
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories.
Haniel Barbosa +4 more
doaj +1 more source
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
Decades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms of efficiency.
Cruanes, Simon +8 more
core +1 more source
A Methodology for the Formal Verification of Dynamic Fault Trees Using HOL Theorem Proving
Dynamic Fault Trees (DFTs) are increasingly being used for modeling the failure behaviors of systems, particularly dynamic behaviors that cannot be captured using conventional combinatorial models.
Yassmeen Elderhalli +2 more
doaj +1 more source

