Recursive ordinal - PDFSEARCH.IO - Document Search Engine

Recursive ordinal
Results: 17

#	Item
1	Towards a Unified Treatment of Induction, I: The General Recursion Theorem Paul Taylor 1995–6 Abstract The recursive construction of a function f : A → Θ consists, paradigmatically, of finding Add to Reading List Source URL: www.paultaylor.eu Language: English - Date: 2009-02-12 12:52:32 Category theory Functional programming Algebras Boolean algebra F-algebra Functor Algebraic structure Ordinal number F-coalgebra Adjoint functors Constructible universe Free algebra
2	Truly Modular (Co)datatypes for Isabelle/HOL Jasmin Christian Blanchette1 , Johannes Hölzl1 , Andreas Lochbihler2 , Lorenz Panny1 , Andrei Popescu1,3 , and Dmitriy Traytel1 1 3 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-01-25 16:18:54 Ordinal numbers Type theory Computability theory Recursion Constructible universe Lambda calculus Standard ML Recursive data type Fold CurryHoward correspondence
3	On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2012-11-16 09:11:16 Computability theory Proof theory Mathematical logic Predicate logic Logic in computer science Primitive recursive functional Reverse mathematics Primitive recursive function Primitive recursive arithmetic First-order logic Peano axioms Ordinal analysis
4	PRELIMINARY EXAMINATION GROUP IN LOGIC AND THE METHODOLOGY OF SCIENCE For the following questions we fix a standard enumeration h ϕe : e ∈ ω i of the partial recursive functions with the corresponding enumeration hWe Add to Reading List Source URL: logic.berkeley.edu Language: English Theory of computation Recursively enumerable set Enumeration Model theory Presentation of a group Ordinal number Ω-consistent theory Mathematics Mathematical logic Computability theory
5	Logic and the Methodology of Science Autumn 2002 Preliminary Exam Draft August 23, Let ϕe be the eth partial recursive function in some standard enumeration, and let We be the domain of ϕe ). Show that there is Add to Reading List Source URL: logic.berkeley.edu Language: English - Date: 2014-08-24 16:43:20 Theory of computation Theoretical computer science Metalogic Model theory Recursively enumerable set Constructible universe Presentation of a group Ordinal number Ω-consistent theory Mathematics Mathematical logic Computability theory
6	Flexible Type Analysis∗ Karl Crary Stephanie Weirich Carnegie Mellon University Add to Reading List Source URL: www.seas.upenn.edu Language: English - Date: 2014-07-10 05:49:28 Programming language theory Mathematics Type constructor Recursive data type Type system Turn Ordinal number Curry–Howard correspondence Type theory Mathematical logic Data types
7	Higher-Order Intensional Type Analysis Stephanie Weirich Department of Computer Science, Cornell University Ithaca, NY 14850, USA Add to Reading List Source URL: www.seas.upenn.edu Language: English - Date: 2014-07-10 05:49:28 Programming language theory Software engineering Symbol Recursive data type Constructor Turn Type system Binding Ordinal number Type theory Mathematical logic Data types
8	Flexible Type Analysis Karl Crary Stephanie Weirich Carnegie Mellon University Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 1999-04-14 16:12:26 Programming language theory Mathematics Type constructor Type system Recursive data type Turn Constructor Ordinal numbers Curry–Howard correspondence Type theory Mathematical logic Data types
9	Objective mathematics in a finite unbounded universe Paul Budnik Mountain Math Software [removed] February 24, 2014 Add to Reading List Source URL: mtnmath.com Language: English - Date: 2014-02-24 17:59:08 Computability theory Proof theory Theory of computation Cardinal numbers Ordinal notation Limit ordinal Recursively enumerable set Recursive ordinal Large countable ordinal Mathematical logic Mathematics Ordinal numbers
10	Generalizing Kleene’s O to ordinals ≥ ω1CK Paul Budnik Mountain Math Software [removed] c 2012 Mountain Math Software Copyright Add to Reading List Source URL: mtnmath.com Language: English - Date: 2012-08-03 19:32:45 Set theory Ordinal notation Recursive ordinal Limit ordinal Large countable ordinal Continuum hypothesis Infinity First uncountable ordinal Enumeration Mathematical logic Ordinal numbers Mathematics