Results 181 to 190 of about 24,299 (218)
Some of the next articles are maybe not open access.

Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory

Fundamenta Informaticae, 2002
Motivated by the analogy ``(NP/Poly)∼analytic'', we propose a co-analytic set W whose finite equivalent W_finite is coNP-complete. The complement of W is in fact a variant of ``infinite clique''. A combinatorial proof of the non-analyticity of W is produced and studied in order to be (eventually) ``finitized'' into a probabilistic proof of ``W_finite ∉
openaire   +3 more sources

On topological set theory

MLQ, 2005
Summary: This paper is concerned with topological set theory, and particularly with Skala's and Manakos' systems, for which we give a topological characterization of the models. This enables us to answer natural questions about those theories, reviewing previous results and proving new ones.
Libert, Thierry, Esser, Olivier
openaire   +4 more sources

Learning Theory and Descriptive Set Theory

Journal of Logic and Computation, 1993
Kevin T. Kelly. Learning Theory and Descriptive Set Theory.
openaire   +2 more sources

Constructive set theory

Journal of Symbolic Logic, 1975
This paper is the third in a series collectively entitled Formal systems of intuitionistic analysis. The first two are [4] and [5] in the bibliography; in them I attempted to codify Brouwer's mathematical practice. In the present paper, which is independent of [4] and [5], I shall do the same for Bishop's book [1].
openaire   +3 more sources

Quantum Set Theory

International Journal of Theoretical Physics, 2003
The formulation of quantum physics in terms of lattice theory, as introduced by Birkhoff and von Neumann, represents a system of quantum physics as a Hilbert space whose elements correspond to physical states while propositions correspond to closed subspaces of the Hilbert space.
Titani, Satoko, Kozawa, Haruhiko
openaire   +1 more source

Laver and set theory

Archive for Mathematical Logic, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

The Theory of Set Tolerances

2014
The theory of single upper and lower tolerances for combinatorial minimization problems has been formalized in 2005 for the three types of cost functions sum, product and maximum, and since then shown to be rather useful in creating heuristics and exact algorithms for the Traveling Salesman Problem and related problems.
Gerold Jäger   +2 more
openaire   +2 more sources

Relational set theory

1995
This article presents a relational formalization of axiomatic set theory, including so-called ZFC and the anti-foundation axiom (AFA) due to P. Aczel. The relational framework of set theory provides a general methodology for the fundamental study on computer and information sciences such as theory of graph transformation, situation semantics and ...
openaire   +1 more source

On Ackermann's set theory

Journal of Symbolic Logic, 1959
Ackermann introduced in [1] a system of axiomatic set theory. The quantifiers of this set theory range over a universe of objects which we call classes. Among the classes we distinguish the sets. Here we shall show that, in some sense, all the theorems of Ackermann's set theory can be proved in Zermelo-Fraenkel's set theory. We shall also show that, on
openaire   +3 more sources

Nonstandard set theory

Journal of Symbolic Logic, 1989
AbstractNonstandard set theory is an attempt to generalise nonstandard analysis to cover the whole of classical mathematics. Existing versions (Nelson, Hrbáček, Kawai) are unsatisfactory in that the unlimited idealisation principle conflicts with the wish to have a full theory of external sets.I re-analyse the underlying requirements of nonstandard set
openaire   +2 more sources

Home - About - Disclaimer - Privacy