Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Jervell, Herman Ruge - Department of Computer Science, Universitetet i Oslo
RECURSIVE INSEPARABILITY IN LINEAR Stal Aanderaa
Ludwig Wittgenstein forklart for matematikere
Truth and provability Herman Ruge Jervell
Limitations of logic programming Herman Ruge Jervell
Review of: Helmut Schwichtenberg Finite notations for in nite terms
Finite trees as ordinals Herman Ruge Jervell
Limitations of logic programming
How to wellorder finite trees and get good ordinal notations
The arithmetic of ffl describing the basic situation
Ordering finite labeled trees CIE 2008 Athens
Thoralf Skolem 1887 1963 Pioneer of computational logic
Dynamic Datastructures Herman R Jervell
A Husserlian framework for describing large Herman Ruge Jervell
Truth and provability Herman Ruge Jervell
TREES AND PROCESSES Instituttseminar, II, UiB -vr 2006
Cut Formulas for Kalmar Elementary Functions Herman Ruge Jervell (Contact)
Ordering finite labeled trees Herman Ruge Jervell
Trees and ordinals PCC 2008 Oslo
Ordering finite labeled trees Herman Ruge Jervell
Kantiansk anskuelse og hyere aritmetikk Herman Ruge Jervell
2-logic and ordinals Dedicated to Jean-Yves Girard on the occasion of his 60th birthday
The importance of indirect arguments Herman Ruge Jervell
Limitations of logic programming Herman Ruge Jervell
Finite trees as ordinals Herman Ruge Jervell
A course in proof theory Herman Ruge Jervell
Review of: Helmut Schwichtenberg Finite notations for infinite terms
SSGRR-2001, L'AQUILA, ITALIA 100 Abstractions and Metaphors on the Internet
Cut Formulas for Kalmar Elementary Functions Herman Ruge Jervell (Contact)
Forelesninger i logikk Herman Ruge Jervell
Informatikk som fag Vitenskapsteoretisk belyst
Review of: Helmut Schwichtenberg Finite notations for infinite terms
