Results 21 to 30 of about 114,330 (265)
, 2023 We introduce a variation on Barthe et al.’s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity, differentiability, or monotonicity, can be expressed and reasoned about in a very natural way, following the structure of ...
Ugo Dal Lago +2 more
openaire +5 more sources
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages [PDF]
Logical Methods in Computer Science, 2006 We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heaps (but with immutable stack variables).
Lars Birkedal +2 more
doaj +1 more source
The Case Against Higher-Order Metaphysics
Metaphysics, 2022 Although higher-order metaphysics seems prima facie to be a promising new approach to metaphysics, it is nonetheless based on a mistake. This mistake is tied to a misuse of formal languages in metaphysics in general, not just to the use of higher-order ...
Thomas Hofweber
doaj +1 more source
Topological Completeness for Higher-Order Logic [PDF]
BRICS Report Series, 1997 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
Light Logics and Higher-Order Processes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 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
Higher-Order Logic and Disquotational Truth
Journal of Philosophical Logic, 2022 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
Log-Linear-Based Logic Mining with Multi-Discrete Hopfield Neural Network
Mathematics, 2023 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
Electronic Notes in Theoretical Computer Science, 2003 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
Annals of Pure and Applied Logic, 2011 Cut-elimination by resolution (CERES) for first-order logic [\textit{M. Baaz} et al., Lect. Notes Comput. Sci. 3452, 481--495 (2005; Zbl 1108.03305)] transforms the set of cut-formulas in a given proof \(\pi\) into a refutable formula \(R\). Given a resolution refutation of \(R\), cuts are sufficiently easily eliminated from \(\pi\).
Stefan Hetzl +2 more
openaire +2 more sources
A Functional (Monadic) Second-Order Theory of Infinite Trees [PDF]
Logical Methods in Computer Science, 2020 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