DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Computable set
Computable set
“The Church-Turing “Thesis” As a Special Corollary of Gödel's
Computability and Incompleteness Fact Sheets
CS 173 Lecture 13: Bijections and Data Types
Realisability for Infinitary Intuitionistic Set Theory 11
Algebraic Aspects of the Computably Enumerable Degrees
Set Theory in Computer Science a Gentle Introduction to Mathematical Modeling I
An Introduction to Computability Theory
Effective Descriptive Set Theory
Approximation of Subsets of Natural Numbers by Ce Sets
The Entscheidungsproblem and Alan Turing
Index Sets of Some Computable Groups
Arxiv:1806.10363V1 [Math.LO]
Chapter 9 Elementary Recursive Function Theory
Arxiv:1703.04075V2 [Cs.LO] 14 Mar 2017 Osbc Ote15sadfcsso H Leri Operation Called Algebraic So the the Al Is the 10]
Provability Logic
Hindman's Theorem, Ultrafilters, and Reverse Mathematics (To Appear in Jsl)
Arxiv:Math/0602483V1
Undecidability in Number Theory
Top View
On Effective Undecidability and Post's Problem
Computability Theory and Foundations of Mathematics
Enumerations in Computable Structure Theory
Algorithmic Complexity and Triviality
Axiomatic Theory of Algorithms
Notes on Definability
BARWISE: INFINITARY LOGIC and ADMISSIBLE SETS Contents 0
The Computably Enumerable Sets: a Partial Survey with Questions
Arxiv:2009.09541V3
Cobham Recursive Set Functions and Weak Set Theories ∗
Minimalist Set Theory
Every Computable Set Is Generically Reducible to Every Computable Set That Does Not Have Density 0 Or 1
Computable Set Theory*
Computability Theory These Notes Cover the Second Part of PMATH 432/632 Taught in the Winter Semester of 2020
Proof Theory: from Arithmetic to Set Theory
Theories and Computability
Effectively Closed Sets and Enumerations
Introduction to Computability Theory
COMPUTABLE MODEL THEORY Contents 1. Introduction And
Computability Theory
[Math.LO] 21 Aug 1998 Infinite Time Turing Machines
Regularity Preserving but Not Reflecting Encodings
An Introduction to Computable Model Theory on Groups and Fields
Recursive and Recursively Enumerable Sets Outline Decision
Relations Between Set Theory and Computability Theory: the Case for Localization Numbers and Sets Closed Under Turing Equivalence
An Example Related to a Theorem of John Gregory
Computable Numbers, Computable Sets, Computable Functions, and How It Is All Related to Interval Computations
Cumulative Hierarchies and Computability Over Universes of Sets
Syllabus Computability Theory
An Equational Re-Engineering of Set Theories
Notices Portrait of the American Mathematical Society National
Set Theory in Computer Science a Gentle Introduction to Mathematical Modeling I
The Turing Degrees and Their Lack of Linear Order
Theories and Computability
Two Applications of Admissible Computability
Recursive and Recursively Enumerable Sets∗
Computable Structure Theory: Part 1 Draft Antonio Montalbán