Results 141 to 150 of about 712,824 (175)
Infinitary S5-Epistemic Logic [PDF]
Mathematical Logic Quarterly, 1997 AbstractIt is known that a theory in S5‐epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas.
Aviad Heifetz
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Geometric Rules in Infinitary Logic
Outstanding Contributions To Logic, 2021Large portions of mathematics such as algebra and geometry can be formalized using first-order axiomatizations. In many cases it is even possible to use a very well-behaved class of first-order axioms, namely, what are called coherent or geometric implications.
Sara Negri
exaly +4 more sources
Truth, Partial Logic and Infinitary Proof Systems [PDF]
Studia Logica, 2017 In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect ...
Norbert Gratzl, Martin Fischer
exaly +2 more sources
Journal of Symbolic Logic, 1976
This paper is concerned with the proof theoretic development of certain infinite languages. These languages contain the usual infinite conjunctions and disjunctions, but in addition to homogeneous quantifiers such as ∀x0x1x2 … and ∃y0y1y2 …, we shall investigate particular subclasses of the dependent quantifiers described by Henkin [1].
openaire +3 more sources
This paper is concerned with the proof theoretic development of certain infinite languages. These languages contain the usual infinite conjunctions and disjunctions, but in addition to homogeneous quantifiers such as ∀x0x1x2 … and ∃y0y1y2 …, we shall investigate particular subclasses of the dependent quantifiers described by Henkin [1].
openaire +3 more sources
Compactness in Infinitary Gödel Logics
Lecture Notes in Computer Science, 2016We outline some model-building procedures for infinitary Godel logics, including a suitable ultrapower construction. As an application, we provide two proofs of the fact that the usual characterizations of cardinals \(\kappa \) such that the Compactness and Weak Compactness Theorems hold for the infinitary language \(\mathcal {L}_{\kappa , \kappa ...
exaly +3 more sources
1994
It is known that a theory in S5-epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas.
openaire +2 more sources
It is known that a theory in S5-epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas.
openaire +2 more sources
Complete Infinitary Type Logics
Studia Logica, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On Conservative Extensions in Logics with Infinitary Predicates
Studia Logica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miklós Ferenczi
exaly +3 more sources
Infinitary logic for computer science
1992Infinitary logic L ∞ω ω , extends first-order logic by allowing infinitary conjunctions and disjunctions (i.e., conjunctions with an infinite number of conjuncts and disjunctions with an infinite number of disjuncts). One usually thinks of infinitary logic as a fairly esoteric logic, which is not of much interest in computer science.
Phokion G. Kolaitis, Moshe Y. Vardi
openaire +2 more sources
Completeness of Infinitary Heterogeneous Logic
Notre Dame Journal of Formal LogicGiven a regular cardinal $κ$ such that $κ^{
exaly +4 more sources