The countable versus uncountable branching recurrences in computability logic

&
Journal of Applied Logic 10 (4):431-446 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.jal.2012.05.001

Links

PhilArchive



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

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

The taming of recurrences in computability logic through cirquent calculus, Part II.Giorgi Japaridze - 2013 - Archive for Mathematical Logic 52 (1-2):213-259.
The taming of recurrences in computability logic through cirquent calculus, Part I.Giorgi Japaridze - 2013 - Archive for Mathematical Logic 52 (1-2):173-212.
The Parallel versus Branching Recurrences in Computability Logic.Wenyan Xu & Sanyang Liu - 2013 - Notre Dame Journal of Formal Logic 54 (1):61-78.
A Real Number Structure that is Effectively Categorical.Peter Hertling - 1999 - Mathematical Logic Quarterly 45 (2):147-182.
On automorphism groups of countable structures.Su Gao - 1998 - Journal of Symbolic Logic 63 (3):891-896.
Soundness and completeness of the Cirquent calculus system CL6 for computability logic.Wenyan Xu & Sanyang Liu - 2012 - Logic Journal of the IGPL 20 (1):317-330.
Intermediate predicate logics determined by ordinals.Pierluigi Minari, Mitio Takano & Hiroakira Ono - 1990 - Journal of Symbolic Logic 55 (3):1099-1124.
Countable filters on ω.Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (2):469-478.
Skolem's Paradox.Timothy Bays - 2012 - In Peter Adamson (ed.), Stanford Encyclopedia of Philosophy. Stanford Encyclopedia of Philosophy.
Why Countable Additivity?Kenny Easwaran - 2013 - Thought: A Journal of Philosophy 2 (1):53-61.
Countable Filters on $omega$.Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (2):469-478.
Computability of validity and satisfiability in probability logics over finite and countable models.Greg Yang - 2015 - Journal of Applied Non-Classical Logics 25 (4):324-372.
Elementary extensions of countable models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (1):139-145.
Power Set Modulo Small, the Singular of Uncountable Cofinality.Saharon Shelah - 2007 - Journal of Symbolic Logic 72 (1):226 - 242.
A dedekind finite borel set.Arnold W. Miller - 2011 - Archive for Mathematical Logic 50 (1-2):1-17.

Analytics

Added to PP
2016-06-30

Downloads
19 (#793,504)

6 months
6 (#509,139)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A cirquent calculus system with clustering and ranking.Wenyan Xu - 2016 - Journal of Applied Logic 16:37-49.

Add more citations

References found in this work

Introduction to computability logic.Giorgi Japaridze - 2003 - Annals of Pure and Applied Logic 123 (1-3):1-99.
Towards applied theories based on computability logic.Giorgi Japaridze - 2010 - Journal of Symbolic Logic 75 (2):565-601.
Separating the basic logics of the basic recurrences.Giorgi Japaridze - 2012 - Annals of Pure and Applied Logic 163 (3):377-389.

Add more references