Results 1 to 10 of about 833,184 (138)
“Mathematics is the Logic of the Infinite”: Zermelo’s Project of Infinitary Logic
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 +2 more sources
de Finetti's coherence and exchangeability in infinitary logic
We continue the investigation towards a logic-based approach to statistics within the infinitary conservative extension of (cid:32)Lukasiewicz logic IRL and prove versions of de Finetti’s theorems on coherence and exchangeability.
Serafina Lapenta
exaly +2 more sources
On the Proof Theory of Infinitary Modal Logic
The article deals with infinitary modal logic. We first discuss the difficulties related to the development of a satisfactory proof theory and then we show how to overcome these problems by introducing a labelled sequent calculus which is sound and ...
Matteo Tesi
exaly +2 more sources
An infinitary propositional probability logic
We introduce a logic for a class of probabilistic Kripke structures that we call type structures, as they are inspired by Harsanyi type spaces. The latter structures are used in theoretical economics and game theory.
Stefano Baratella
exaly +2 more sources
Axiomatizations of universal classes through infinitary logic
We present a scheme for providing axiomatizations of universal classes. We use infinitary sentences there. New proofs of Birkhoff’s $$\mathsf {HSP}$$HSP-theorem and Mal’cev’s $$\mathsf {SPP_U}$$SPPU-theorem are derived.
Michał Stronkowski
exaly +2 more sources
Encoding many-valued logic in $\lambda$-calculus [PDF]
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
INFINITARY LOGIC HAS NO EXPRESSIVE EFFICIENCY OVER FINITARY LOGIC [PDF]
We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi $ (in $\mathcal {L}_{\omega ,\omega }$ ) is equivalent to
Matthew Harrison-Trainor +1 more
semanticscholar +1 more source
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications [PDF]
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
Infinitary logic with infinite sequents: syntactic investigations
The present paper deals with a purely syntactic analysis of infinitary logic with infinite sequents. In particular, we discuss sequent calculi for classical and intuitionistic infinitary logic with good structural properties based on sequents possibly ...
Matteo Tesi
semanticscholar +1 more source
Quantifying over Boolean announcements [PDF]
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

