<--- Back to Details
First PageDocument Content
Mathematics / Order theory / Abstraction / Structure / Wellfoundedness / Proof theory / Computability theory / Linear extension / Reverse mathematics / Well-quasi-ordering / Antichain / Countable set
Date: 2016-06-04 05:36:00
Mathematics
Order theory
Abstraction
Structure
Wellfoundedness
Proof theory
Computability theory
Linear extension
Reverse mathematics
Well-quasi-ordering
Antichain
Countable set

Research Statement Emanuele Frittaion 2016

Add to Reading List

Source URL: www.math.tohoku.ac.jp

Download Document from Source Website

File Size: 183,02 KB

Share Document on Facebook

Similar Documents

Concurrent computing / Scheduling / Computer architecture / System software / Preemption / Thread / Cooperative multitasking / Preempt / Synchronization / Computing

Overview Abstraction The Rest

DocID: 1xW1V - View Document

Computing / Software engineering / Computer programming / Parser generators / Compiling tools / Functional programming / Parser combinator / Parsing / Lex / Scala / Apache HTTP Server

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

DocID: 1xVQq - View Document

Logic / Mathematical logic / Mathematics / Predicate logic / Propositional calculus / Semantics / Philosophical logic / Satisfiability modulo theories / Predicate / Literal / Well-formed formula / Model checking

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

DocID: 1xVJt - View Document

Mathematical logic / Logic / Predicate logic / Mathematics / Predicate / FO / Atomic sentence / Primitive recursive function / Syntactic predicate

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

DocID: 1xVFk - View Document