Results 11 to 20 of about 1,524,096 (164)
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 +5 more sources
Infinitary logic and basically disconnected compact Hausdorff spaces [PDF]
Journal of Logic and Computation, 2017 We extend \L ukasiewicz logic obtaining the infinitary logic $\mathcal{IR}\L$ whose models are algebras $C(X,[0,1])$, where $X$ is a basically disconnected compact Hausdorff space.
A. Di Nola +2 more
semanticscholar +2 more sources
Infinitary Classical Logic: Recursive Equations and Interactive Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled by propositional variables and logical connectives.
Michele Basaldella
doaj +3 more sources
The Gödel-McKinsey-Tarski embedding for infinitary intuitionistic logic and its extensions
Annals of Pure and Applied Logic, 2023 The Gödel-McKinsey-Tarski embedding allows to view intuitionistic logic through the lenses of modal logic. In this work, an extension of the modal embedding to infinitary intuitionistic logic is introduced.
Matteo Tesi, Sara Negri
semanticscholar +2 more sources
Journal of Advances in Mathematics and Computer Science, 2022 The incompleteness of set theory \(Z F C\) leads one to look for natural nonconservative extensions of \(Z F C\) in which one can prove statements independent of \(Z F C\) which appear to be "true".
J. Foukzon
semanticscholar +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
Omitting Types in Fragments and Extensions of First Order Logic
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 +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