A Sequent Calculus for Urn Logic

Journal of Logic, Language and Information 24 (2):131-147 (2015)
  Copy   BIBTEX

Abstract

Approximately speaking, an urn model for first-order logic is a model where the domain of quantification changes depending on the values of variables which have been bound by quantifiers previously. In this paper we introduce a model-changing semantics for urn-models, and then give a sequent calculus for urn logic by introducing formulas which can be read as saying that “after the individuals a1,..., an have been drawn, A is the case”.

Categories

Keywords

Reprint years

DOI

10.1007/s10849-015-9216-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

2-Sequent calculus: a proof theory of modalities.Andrea Masini - 1992 - Annals of Pure and Applied Logic 58 (3):229-246.
Canonical proof nets for classical logic.Richard McKinley - 2013 - Annals of Pure and Applied Logic 164 (6):702-732.
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
A Tree-sequent Calculus For A Natural Predicate Extension Of Visser's Propositional Logic.Ryo Ishigaki & Kentaro Kikuchi - 2007 - Logic Journal of the IGPL 15 (2):149-164.
A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language.Michael Gabbay - 2011 - Journal of Symbolic Logic 76 (2):673 - 699.
A proof-search procedure for intuitionistic propositional logic.R. Alonderis - 2013 - Archive for Mathematical Logic 52 (7-8):759-778.
A cut-free simple sequent calculus for modal logic S5.Francesca Poggiolesi - 2008 - Review of Symbolic Logic 1 (1):3-15.
A purely syntactic and cut-free sequent calculus for the modal logic of provability.Francesca Poggiolesi - 2009 - Review of Symbolic Logic 2 (4):593-611.
Intuitionistic sequent calculi for finitely many-valued logics.E. Reznik & P. Curmin - 2001 - Logic Journal of the IGPL 9 (6):793-812.
Bunched Logics Displayed.James Brotherston - 2012 - Studia Logica 100 (6):1223-1254.
A Deterministic Terminating Sequent Calculus For Gödel-dummett Logic.R. Dyckhoff - 1999 - Logic Journal of the IGPL 7 (3):319-326.
Sequent Calculi And Quasivarieties.Katarzyna Palasinska - 2000 - Reports on Mathematical Logic:107-131.
A Cut-free Sequent Calculus For The Logic Of Constant Domains With A Limited Amount Of Duplications.C. Fiorentini & P. Miglioli - 1999 - Logic Journal of the IGPL 7 (6):733-753.
Reduction Rules for Intuitionistic $${{\lambda}{\rho}}$$ λ ρ -calculus.Ken-Etsu Fujita, Ryo Kashima, Yuichi Komori & Naosuke Matsuda - 2015 - Studia Logica 103 (6):1225-1244.
Linear logic with fixed resources.Dmitry A. Archangelsky & Mikhail A. Taitslin - 1994 - Annals of Pure and Applied Logic 67 (1-3):3-28.

Analytics

Added to PP
2015-04-08

Downloads
40 (#378,975)

6 months
7 (#350,235)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Rohan French
University of California, Davis

Citations of this work

Game Semantics, Quantifiers and Logical Omniscience.Bruno Ramos Mendonça - forthcoming - Logic and Logical Philosophy:1-22.

Add more citations

References found in this work

Context and logical form.Jason Stanley - 2000 - Linguistics and Philosophy 23 (4):391--434.
Context and Logical Form.Jason Stanley - 2013 - In Maite Ezcurdia & Robert J. Stainton (eds.), The Semantics-Pragmatics Boundary in Philosophy. Broadview Press. pp. 316.
Proof theory.Gaisi Takeuti - 1975 - New York, N.Y., U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.
Impossible possible worlds vindicated.Jaakko Hintikka - 1975 - Journal of Philosophical Logic 4 (4):475 - 484.

View all 13 references / Add more references