Sciweavers

119 search results - page 8 / 24
» A First-Order Isomorphism Theorem
Sort
View
JCSS
1998
74views more  JCSS 1998»
13 years 7 months ago
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
Manindra Agrawal, Eric Allender, Steven Rudich
GC
2007
Springer
13 years 7 months ago
Subdivision Extendibility
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
Ronald J. Gould, Thor Whalen
JSYML
2002
78views more  JSYML 2002»
13 years 7 months ago
Some Results on Permutation Group Isomorphism and Categoricity
Abstract. We extend Morley's Theorem to show that if a theory is -pcategorical for some uncountable cardinal , it is uncountably categorical. We then discuss -p-categoriticy a...
Anand Pillay, Mark D. Schlatter
CADE
1994
Springer
13 years 11 months ago
PROTEIN: A PROver with a Theory Extension INterface
Abstract. PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over built-in theories. Besides various standardrefinements knownformodelelim...
Peter Baumgartner, Ulrich Furbach
TLCA
2009
Springer
14 years 2 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey