Results 1 to 10 of about 712,824 (175)
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic [PDF]
Logical Methods in Computer Science, 2018 We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way.
Jörg Endrullis +4 more
doaj +12 more sources
Omitting Types in Fragments and Extensions of First Order Logic [PDF]
Bulletin of the Section of Logic, 2021 Fix \(2 < n < \omega\). Let \(L_n\) denote first order logic restricted to the first n variables. Using the machinery of algebraic logic, positive and negative results on omitting types are obtained for \(L_n\) and for infinitary variants and extensions ...
Tarek Sayed Ahmed
doaj +2 more sources
Encoding many-valued logic in $\lambda$-calculus [PDF]
Logical Methods in Computer Science, 2021 We will extend the well-known Church encoding of Boolean logic into $\lambda$-calculus to an encoding of McCarthy's $3$-valued logic into a suitable infinitary extension of $\lambda$-calculus that identifies all unsolvables by $\bot$, where $\bot$ is a ...
Fer-Jan de Vries
doaj +1 more source
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications [PDF]
Logical Methods in Computer Science, 2023 Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has been broadly used as a tool to approximate the terms of several variants of the $\lambda$-calculus. Many results arise from a Commutation theorem relating
Rémy Cerda, Lionel Vaux Auclair
doaj +1 more source
Quantifying over Boolean announcements [PDF]
Logical Methods in Computer Science, 2022 Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL.
Hans van Ditmarsch, Tim French
doaj +1 more source
Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]
Logical Methods in Computer Science, 2022 Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj +1 more source
“Mathematics is the Logic of the Infinite”: Zermelo’s Project of Infinitary Logic
Studies in Logic, Grammar and Rhetoric, 2021 In this paper I discuss Ernst Zermelo’s ideas concerning the possibility of developing a system of infinitary logic that, in his opinion, should be suitable for mathematical inferences. The presentation of Zermelo’s ideas is accompanied with some remarks
Pogonowski Jerzy
doaj +1 more source
The Topology-Free Construction of the Universal Type Structure for Conditional Probability Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We construct the universal type structure for conditional probability systems without any topological assumption, namely a type structure that is terminal, belief-complete, and non-redundant.
Pierfrancesco Guarino
doaj +1 more source
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
Logical Methods in Computer Science, 2022 We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
doaj +1 more source
A Coalgebraic Approach to Dualities for Neighborhood Frames [PDF]
Logical Methods in Computer Science, 2022 We develop a uniform coalgebraic approach to J\'onsson-Tarski and Thomason type dualities for various classes of neighborhood frames and neighborhood algebras.
Guram Bezhanishvili +2 more
doaj +1 more source