DOCSLIB.ORG
  • Sign Up
  • Log In
  • Upload
  • Sign Up
  • Log In
  • Upload
  • Home
  • »  Tags
  • »  Computable set

Computable set

  • “The Church-Turing “Thesis” As a Special Corollary of Gödel's

    “The Church-Turing “Thesis” As a Special Corollary of Gödel's

  • Computability and Incompleteness Fact Sheets

    Computability and Incompleteness Fact Sheets

  • CS 173 Lecture 13: Bijections and Data Types

    CS 173 Lecture 13: Bijections and Data Types

  • Realisability for Infinitary Intuitionistic Set Theory 11

    Realisability for Infinitary Intuitionistic Set Theory 11

  • Algebraic Aspects of the Computably Enumerable Degrees

    Algebraic Aspects of the Computably Enumerable Degrees

  • Set Theory in Computer Science a Gentle Introduction to Mathematical Modeling I

    Set Theory in Computer Science a Gentle Introduction to Mathematical Modeling I

  • An Introduction to Computability Theory

    An Introduction to Computability Theory

  • Effective Descriptive Set Theory

    Effective Descriptive Set Theory

  • Approximation of Subsets of Natural Numbers by Ce Sets

    Approximation of Subsets of Natural Numbers by Ce Sets

  • The Entscheidungsproblem and Alan Turing

    The Entscheidungsproblem and Alan Turing

  • Index Sets of Some Computable Groups

    Index Sets of Some Computable Groups

  • Arxiv:1806.10363V1 [Math.LO]

    Arxiv:1806.10363V1 [Math.LO]

  • Chapter 9 Elementary Recursive Function Theory

    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]

    Arxiv:1703.04075V2 [Cs.LO] 14 Mar 2017 Osbc Ote15sadfcsso H Leri Operation Called Algebraic So the the Al Is the 10]

  • Provability Logic

    Provability Logic

  • Hindman's Theorem, Ultrafilters, and Reverse Mathematics (To Appear in Jsl)

    Hindman's Theorem, Ultrafilters, and Reverse Mathematics (To Appear in Jsl)

  • Arxiv:Math/0602483V1

    Arxiv:Math/0602483V1

  • Undecidability in Number Theory

    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


© 2024 Docslib.org    Feedback