Well-founded relation - PDFSEARCH.IO - Document Search Engine

Well-founded relation
Results: 22

#	Item
1	All-Termination(T )? Panagiotis Manolios and Aaron Turon Northeastern University {pete,turon}@ccs.neu.edu Abstract. We introduce the All-Termination(T ) problem: given a termination solver T and a collection of functions Add to Reading List Source URL: www.mpi-sws.org Language: English - Date: 2010-01-10 16:47:25 Mathematical analysis Mathematics Analysis Functions and mappings Static program analysis Termination analysis Limit of a function IP Well-founded relation Measure theory Computability theory Inequalities
2	Intuitionistic Sets and Ordinals Paul Taylor 1993 Abstract Transitive extensional well founded relations provide an intuitionistic notion of ordinals Add to Reading List Source URL: www.paultaylor.eu Language: English - Date: 2009-02-12 12:52:19 Ordinal numbers Set theory Mathematical logic Recursion Wellfoundedness Constructible universe Well-founded relation Transfinite induction Transitive set Burali-Forti paradox Equality Implementation of mathematics in set theory
3	Linearizing bad sequences: upper bounds for the product and majoring well quasi-orders Sergio Abriola1 , Santiago Figueira2,3? , and Gabriel Senno2 1 2 Add to Reading List Source URL: www.glyc.dc.uba.ar Language: English - Date: 2012-06-18 12:18:22 Multiset Summation Partially ordered set Well-founded relation Binomial coefficient Mathematics Order theory Lexicographical order
4	Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-08-27 06:04:04 Recursion Computability theory Mathematical logic Programming idioms Theory of computation Fold Well-founded relation Function Pattern matching Mathematics Computer programming Computing
5	Nancy L. Schwartz Lecture ECONOMICS AND LANGUAGE ARIEL RUBINSTEIN Add to Reading List Source URL: www.kellogg.northwestern.edu Language: English - Date: 2002-04-08 16:58:34 Binary relation Preference Equivalence relation Function Total order Completeness Finitary relation Well-founded relation Residuated lattice Mathematics Order theory Mathematical logic
6	System T and the Product of Selection Functions Martín Escardó1 , Paulo Oliva2 , and Thomas Powell2 1 University of Birmingham Department of Computer Science Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2011-06-20 06:36:33 Proof theory Computability theory Functions and mappings Theory of computation Dialectica interpretation Function Primitive recursive function Peano axioms Well-founded relation Mathematics Mathematical logic Logic
7	Predicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions∗ Naohi Eguchi Institute of Computer Science, University of Innsbruck, Austria Add to Reading List Source URL: www.imn.htwk-leipzig.de Language: English - Date: 2013-08-26 10:13:12 Mathematical logic Recursion Theory of computation Functions and mappings Programming idioms Primitive recursive function Well-founded relation ELEMENTARY Fold Computability theory Mathematics Theoretical computer science
8	INFINITE SETS THAT SATISFY THE PRINCIPLE OF OMNISCIENCE IN ANY VARIETY OF CONSTRUCTIVE MATHEMATICS ´ MART´IN H. ESCARDO Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2013-01-09 04:45:03 Continuous function Function Well-founded relation Metric space Characterizations of the exponential function Lambda calculus Mathematics Mathematical analysis Calculus
9	Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very Add to Reading List Source URL: isabelle.in.tum.de Language: English - Date: 2014-08-27 06:04:04 Recursion Computability theory Mathematical logic Programming idioms Theory of computation Fold Well-founded relation Function Pattern matching Mathematics Computer programming Computing
10	General Recursion The Choice ➜ Limited expressiveness, automatic termination COMP 4161 NICTA Advanced Course Add to Reading List Source URL: cs4161.web.cse.unsw.edu.au Language: English - Date: 2014-11-10 04:09:39 Computability theory Programming idioms Theoretical computer science Recursion Mathematical logic Well-founded relation Lambda calculus Quicksort Computer programming Mathematics Computing