Sciweavers

1670 search results - page 101 / 334
» On Skolemization in constructive theories
Sort
View
APAL
2002
79views more  APAL 2002»
15 years 6 months ago
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms
In this paper we discuss extensions of Feferman's theory T0 for explicit mathematics by the so-called limit and Mahlo axioms and present a novel approach to constructing natu...
Gerhard Jäger, Thomas Studer
DAM
2000
84views more  DAM 2000»
15 years 6 months ago
Three-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
Peter Eades, Antonios Symvonis, Sue Whitesides
JSYML
1998
68views more  JSYML 1998»
15 years 6 months ago
Pseudo-Superstructures as Nonstandard Universes
A definition of nonstandard universe which gets over the limitation to the finite levels of the cumulative hierarchy is proposed. Though necessarily nonwellfounded, nonstandard ...
Mauro Di Nasso
APAL
2011
15 years 1 months ago
A sorting network in bounded arithmetic
We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an ex...
Emil Jerábek
POPL
2004
ACM
16 years 6 months ago
Tridirectional typechecking
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
Joshua Dunfield, Frank Pfenning