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

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,211

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 I.Giorgi Japaridze - 2013 - Archive for Mathematical Logic 52 (1-2):173-212.
Computability and uncountable linear orders II: Degree spectra.Noam Greenberg, Asher M. Kach, Steffen Lempp & Daniel D. Turetsky - 2015 - Journal of Symbolic Logic 80 (1):145-178.
Computability and uncountable linear orders I: Computable categoricity.Noam Greenberg, Asher M. Kach, Steffen Lempp & Daniel D. Turetsky - 2015 - Journal of Symbolic Logic 80 (1):116-144.
Computability in uncountable binary trees.Reese Johnston - 2019 - Journal of Symbolic Logic 84 (3):1049-1098.
Computable categoricity for pseudo-exponential fields of size ℵ 1.Jesse Johnson - 2014 - Annals of Pure and Applied Logic 165 (7-8):1301-1317.
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.
A Real Number Structure that is Effectively Categorical.Peter Hertling - 1999 - Mathematical Logic Quarterly 45 (2):147-182.
On self-embeddings of computable linear orderings.Rodney G. Downey, Carl Jockusch & Joseph S. Miller - 2006 - Annals of Pure and Applied Logic 138 (1):52-76.
An atomic theory with no prime models.T. Sayed Ahmed - 2007 - Australasian Journal of Logic 5:85-88.
Martin's axiom and a regular topological space with uncountable net weight whose countable product is hereditarily separable and hereditarily lindelöf.Krzysztof Ciesielski - 1987 - Journal of Symbolic Logic 52 (2):396-399.

Analytics

Added to PP
2016-06-30

Downloads
38 (#662,188)

6 months
12 (#291,819)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

S Liu

Citations of this work

A cirquent calculus system with clustering and ranking.Wenyan Xu - 2016 - Journal of Applied Logic 16:37-49.
A Propositional Cirquent Calculus for Computability Logic.Giorgi Japaridze - 2024 - Journal of Logic, Language and Information 33 (4):363-389.

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