<--- Back to Details
First PageDocument Content
Metalogic / Complexity classes / Mathematical logic / Proof theory / Structural complexity theory / Reduction / Petri net / PP / Decidability / Theoretical computer science / Computational complexity theory / Mathematics
Date: 2005-06-09 03:53:09
Metalogic
Complexity classes
Mathematical logic
Proof theory
Structural complexity theory
Reduction
Petri net
PP
Decidability
Theoretical computer science
Computational complexity theory
Mathematics

Networks of Relations Thesis by Matthew Cook

Add to Reading List

Source URL: paradise.caltech.edu

Download Document from Source Website

File Size: 1,21 MB

Share Document on Facebook

Similar Documents

Algebra / Mathematics / Abstract algebra / Homotopy theory / Category theory / Algebraic structures / Differential geometry / Algebraic topology / Groupoid / Lie algebroid / Group action / Equivalence relation

INDEX THEORY AND GROUPOIDS CLAIRE DEBORD AND JEAN-MARIE LESCURE Abstract. These lecture notes are mainly devoted to a proof using groupoids and KK-theory of Atiyah and Singer’s index theorem on compact smooth manifolds

DocID: 1xVj5 - View Document

I0 / Invariant / XC

Author Proof A Specification Theory of Real-Time Processes Chris Chilton1 , Marta Kwiatkowska1 , Faron Moller2 , and Xu Wang2(B) 1 2

DocID: 1xUA7 - View Document

Proof Articles Sharing Proofs Theory Packages

DocID: 1vgUI - View Document

The theory of canonical lifts for abelian varieties (draft version) Chloe Martindale February 10, 2016 These notes are from a talk at Leiden University, of which the aim was to understand Drinfeld’s proof of the Serre-

DocID: 1uZwX - View Document

A00137: Proof of Work as it relates to the theory of the firm. Proof of Work as it relates to the theory of the firm.

DocID: 1uTc3 - View Document