Results 1  10
of
681
Typed lambdacalculus in classical ZermeloFraenkel set theory
 ARCHIVE OF MATHEMATICAL LOGIC
, 2001
"... In this paper, we develop a system of typed lambdacalculus for the ZermeloFraenkel set theory, in the framework of classical logic. The first, and the simplest system of typed lambdacalculus is the system of simple types, which uses the intuitionistic propositional calculus, with the only connect ..."
Abstract

Cited by 47 (12 self)
 Add to MetaCart
In this paper, we develop a system of typed lambdacalculus for the ZermeloFraenkel set theory, in the framework of classical logic. The first, and the simplest system of typed lambdacalculus is the system of simple types, which uses the intuitionistic propositional calculus, with the only connective #. It is very important, because the well known CurryHoward correspondence between proofs and programs was originally discovered with it, and because it enjoys the normalization property : every typed term is strongly normalizable. It was extended to second order intuitionistic logic, in 1970, by J.Y. Girard[4], under the name of system F, still with the normalization property. More recently, in 1990, the CurryHoward correspondence was extended to classical logic, following Felleisen and Griffin [6] who discovered that the law of Peirce corresponds to control instructions in functional programming
An oracle builder’s toolkit
, 2002
"... We show how to use various notions of genericity as tools in oracle creation. In particular, 1. we give an abstract definition of genericity that encompasses a large collection of different generic notions; 2. we consider a new complexity class AWPP, which contains BQP (quantum polynomial time), and ..."
Abstract

Cited by 46 (11 self)
 Add to MetaCart
(Show Context)
We show how to use various notions of genericity as tools in oracle creation. In particular, 1. we give an abstract definition of genericity that encompasses a large collection of different generic notions; 2. we consider a new complexity class AWPP, which contains BQP (quantum polynomial time), and infer several strong collapses relative to SPgenerics; 3. we show that under additional assumptions these collapses also occur relative to Cohen generics; 4. we show that relative to SPgenerics, ULIN ∩ coULIN ̸ ⊆ DTIME(n k) for any k, where ULIN is unambiguous linear time, despite the fact that UP ∪ (NP ∩ coNP) ⊆ P relative to these generics; 5. we show that there is an oracle relative to which NP/1∩coNP/1 ̸ ⊆ (NP∩coNP)/poly; and 6. we use a specialized notion of genericity to create an oracle relative to which NP BPP ̸ ⊇ MA.
The Power of Vacillation in Language Learning
, 1992
"... Some extensions are considered of Gold's influential model of language learning by machine from positive data. Studied are criteria of successful learning featuring convergence in the limit to vacillation between several alternative correct grammars. The main theorem of this paper is that there ..."
Abstract

Cited by 46 (13 self)
 Add to MetaCart
(Show Context)
Some extensions are considered of Gold's influential model of language learning by machine from positive data. Studied are criteria of successful learning featuring convergence in the limit to vacillation between several alternative correct grammars. The main theorem of this paper is that there are classes of languages that can be learned if convergence in the limit to up to (n+1) exactly correct grammars is allowed but which cannot be learned if convergence in the limit is to no more than n grammars, where the no more than n grammars can each make finitely many mistakes. This contrasts sharply with results of Barzdin and Podnieks and, later, Case and Smith, for learnability from both positive and negative data. A subset principle from a 1980 paper of Angluin is extended to the vacillatory and other criteria of this paper. This principle, provides a necessary condition for circumventing overgeneralization in learning from positive data. It is applied to prove another theorem to the eff...
Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC)
, 2005
"... Motivation: Pathway Hunter Tool (PHT), is a fast, robust and userfriendly tool to analyse the shortest paths in metabolic pathways. The user can perform shortest path analysis for one or more organisms or can build virtual organisms (networks) using enzymes. Using PHT, the user can also calculate th ..."
Abstract

Cited by 43 (1 self)
 Add to MetaCart
(Show Context)
Motivation: Pathway Hunter Tool (PHT), is a fast, robust and userfriendly tool to analyse the shortest paths in metabolic pathways. The user can perform shortest path analysis for one or more organisms or can build virtual organisms (networks) using enzymes. Using PHT, the user can also calculate the average shortest path (Jungnickel, 2002 Graphs, Network and Algorithm. SpringerVerlag, Berlin), average alternate path and the top 10 hubs in the metabolic network. The comparative study of metabolic connectivity and observing the cross talk between metabolic pathways among various sequenced genomes is possible. Results: A new algorithm for finding the biochemically valid connectivity between metabolites in a metabolic network was developed and implemented. A predefined manual assignment of side metabolites (like ATP, ADP, water, CO2 etc.) and main metabolites is not necessary as the new concept uses chemical structure information (global and local similarity) between metabolites for identification of the shortest path.
Set mapping reflection
, 2003
"... Abstract. In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2ω = ω2 and that L(P(ω1)) satisfies the Axiom of Choice. It will also be demonstra ..."
Abstract

Cited by 39 (7 self)
 Add to MetaCart
(Show Context)
Abstract. In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2ω = ω2 and that L(P(ω1)) satisfies the Axiom of Choice. It will also be demonstrated that this reflection principle implies that (κ) fails for all regular κ> ω1. 1.
Injective positively ordered monoids
 I, J. Pure Appl. Algebra
, 1992
"... We define in this paper a certain notion of completeness for a wide class of commutative (pre)ordered monoids (from now on P.O.M.’s). This class seems to be the natural context for studying structures like measurable function spaces, equidecomposability types of spaces, partially ordered abelian gro ..."
Abstract

Cited by 30 (15 self)
 Add to MetaCart
(Show Context)
We define in this paper a certain notion of completeness for a wide class of commutative (pre)ordered monoids (from now on P.O.M.’s). This class seems to be the natural context for studying structures like measurable function spaces, equidecomposability types of spaces, partially ordered abelian groups and cardinal algebras. Then, we can prove that roughly speaking, spaces of measures with values in complete P.O.M.’s are complete P.O.M.’s. Furthermore, this notion of completeness yields us an ‘arithmetical ’ characterization of injective P.O.M.’s.
Square in core models
 Bull. Symbolic Logic
, 2001
"... Abstract. Our main results are: 1) every countably certified extender that coheres with the core model K is on the extender sequence of K, 2)Kcomputes successors of weakly compact cardinals correctly, 3) every model on the maximal 1small construction is an iterate of K, 4) (joint with W. J. Mitchel ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
Abstract. Our main results are: 1) every countably certified extender that coheres with the core model K is on the extender sequence of K, 2)Kcomputes successors of weakly compact cardinals correctly, 3) every model on the maximal 1small construction is an iterate of K, 4) (joint with W. J. Mitchell) K�κ is universal for mice of height ≤ κ whenever κ ≥ℵ2,5)ifthereisaκ such that κ is either a singular countably closed cardinal or a weakly compact cardinal, and � <ω κ fails, then there are inner models with Woodin cardinals, and 6) an ωErdös cardinal suffices to develop the basic theory of K. 1.
Asymptotic cones of finitely presented groups
"... Abstract. Let G be a connected semisimple Lie group with at least one absolutely simple factor S such that Rrank(S) ≥ 2 and let Γ be a uniform lattice in G. (a) If CH holds, then Γ has a unique asymptotic cone up to homeomorphism. (b) If CH fails, then Γ has 2 2ω asymptotic cones up to homeomorphi ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Let G be a connected semisimple Lie group with at least one absolutely simple factor S such that Rrank(S) ≥ 2 and let Γ be a uniform lattice in G. (a) If CH holds, then Γ has a unique asymptotic cone up to homeomorphism. (b) If CH fails, then Γ has 2 2ω asymptotic cones up to homeomorphism. 1.
A five element basis for the uncountable linear orders
 Annals of Mathematics
"... Abstract. In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear orders has a five element basis. In fact such a basis f ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear orders has a five element basis. In fact such a basis follows from the Proper Forcing Axiom, a strong form of the Baire Category Theorem. The elements are X, ω1, ω ∗ 1, C, C ∗ where X is any suborder of the reals of cardinality ℵ1 and C is any Countryman line. This confirms a longstanding conjecture of Shelah. 1.