Zobrazeno 1 - 10
of 130
pro vyhledávání: '"Zach, Richard"'
Autor:
Zach, Richard
Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert dev
Externí odkaz:
http://arxiv.org/abs/2404.09033
Autor:
Mancosu, Paolo, Zach, Richard
Several letters by Kurt G\"odel and Johann (J\'anos) von Neumann from the (so far uncatalogued) archive of Abraham (Adolf) Fraenkel at the National Library of Israel are published and discussed. These include two fragments by G\"odel of special inter
Externí odkaz:
http://arxiv.org/abs/2301.09814
Autor:
Zach, Richard
Publikováno v:
Logic and Logical Philosophy vol. 32, no. 2 (2023), pp. 161-179
Angell's logic of analytic containment AC has been shown to be characterized by a 9-valued matrix NC by Ferguson, and by a 16-valued matrix by Fine. It is shown that the former is the image of a surjective homomorphism from the latter, i.e., an epimo
Externí odkaz:
http://arxiv.org/abs/2105.15160
Autor:
Elkind, Landon D. C., Zach, Richard
The use of the symbol $\lor$ for disjunction in formal logic is ubiquitous. Where did it come from? The paper details the evolution of the symbol $\lor$ in its historical and logical context. Some sources say that disjunction in its use as connecting
Externí odkaz:
http://arxiv.org/abs/2012.06072
Autor:
Zach, Richard
Publikováno v:
The Review of Symbolic Logic 14 (2021) 645-686
Any set of truth-functional connectives has sequent calculus rules that can be generated systematically from the truth tables of the connectives. Such a sequent calculus gives rise to a multi-conclusion natural deduction system and to a version of Pa
Externí odkaz:
http://arxiv.org/abs/2001.00662
Externí odkaz:
https://doi.org/10.1093/oso/9780192895936.001.0001
Autor:
Baaz, Matthias, Zach, Richard
Publikováno v:
Avron, Arnon; Dershowitz, Nachum; Rabinovich, Alexander (Eds.). Pillars of Computer Science. LNCS 4800. Berlin: Springer, 2008. 107-129
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuition
Externí odkaz:
http://arxiv.org/abs/1908.01200
Autor:
Baaz, Matthias, Zach, Richard
Any intermediate propositional logic (i.e., a logic including intuitionistic logic and contained in classical logic) can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert's $
Externí odkaz:
http://arxiv.org/abs/1907.04477
Autor:
Burns, Samara, Zach, Richard
Publikováno v:
The Review of Symbolic Logic 14 (2021) 910-929
We investigate a recent proposal for modal hypersequent calculi. The interpretation of relational hypersequents incorporates an accessibility relation along the hypersequent. These systems give the same interpretation of hypersequents as Lellman's li
Externí odkaz:
http://arxiv.org/abs/1805.09437
Autor:
Zach, Richard
Publikováno v:
Australasian Journal of Logic 15 (3):609-628 (2018)
Priest has provided a simple tableau calculus for Chellas's conditional logic Ck. We provide rules which, when added to Priest's system, result in tableau calculi for Chellas's CK and Lewis's VC. Completeness of these tableaux, however, relies on the
Externí odkaz:
http://arxiv.org/abs/1805.09446