A hierarchy of primitive recursive sequence functions
A lower bound for the complexity of Craig's interpolants in sentinential logic.
A new decidable Horn fragment of predicate calculus.
A nonstandard approach to arithmetic.
A Nonstandard Approach to the Uniqueness Problem for the Navier-Stokes Equations.
A non-uniform finitary relational semantics of system T
We study iteration and recursion operators in the denotational semantics of typed λ-calculi derived from the multiset relational model of linear logic. Although these operators are defined as fixpoints of typed functionals, we prove them finitary in the sense of Ehrhard’s finiteness spaces.
A note on a generalization of some undecidability results in group theory.
A note on comparison of Turing machines with computers
A Note on Contraproduction Domains.
A Note On Generalization Of Some Undecidability Results In Group Theory
A note on initial segments below
A note on reflection.
A note on separating the relativized polynomial time hierarchy by immune sets
A note on the computational complexity of hierarchical overlapping clustering
In this paper the computational complexity of the problem of the approximation of a given dissimilarity measure on a finite set by a -ultrametric on and by a Robinson dissimilarity measure on is investigared. It is shown that the underlying decision problems are NP-complete.
A note on the Souslin operations
A notion of semigenericity
A partial comparison of two conditions on the intersections of regressive sets.
A probabilistic approach to automaton-environment systems
A Reducibility Arising from the Boone Groups.
A Remark on Semiproductive Sets.