Related papers: The Creating Subject, the Brouwer-Kripke Schema, a…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We formulate and explore two basic axiomatic systems of typefree subjective probability. One of them explicates a notion of finitely additive probability. The other explicates a concept of infinitely additive probability. It is argued that…
We develop a method for showing that various modal logics that are valid in their countably generated canonical Kripke frames must also be valid in their uncountably generated ones. This is applied to many systems, including the logics of…
This article contains a proof of the basic lemma. This lemma, discovered by Beilinson, yields a motivic proof of the Andreotti-Frankel theorem for affine varieties. Next, it is shown that the category of Cohomologically Constructible…
We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.
A class of random graphs is introduced and studied. The graphs are constructed in an algorithmic way from five motifs which were found in [Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U., Science, 2002, 298, 824-827].…
We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.
In this paper, we introduce the notion of $\alpha$--contractive mapping of Meir--Keeler type in complete metric spaces and prove new theorems which assure the existence, uniqueness and iterative approximation of the fixed point for this…
We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We suggest a unifying approach using operators where we allow the…
In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…
The classical Kramers problem with specular -- diffuse boundary conditions of the kinetic theory is considered. On an example of Kramers problem the new method of the decision of the boundary problems of the kinetic theory is stated. The…
New in the probability theory and eventology theory, the concept of Kopula (eventological copula) is introduced. The theorem on the characterization of the sets of events by Kopula is proved, which serves as the eventological pre-image of…
Let $K:k$ be a field extension and let $\Lambda$ be a finite-dimensional $k$-algebra. We investigate the relationship between $\Lambda$ and $\Lambda_K = \Lambda \otimes_k K$ with particular emphasis on various aspects of $\tau$-tilting…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
The main aim of this paper is to extend Bochner's technique to statistical structures. Other topics related to this technique are also introduced to the theory of statistical structures. It deals, in particular, with Hodge's theory,…
A common objection to the definition of intuitionistic implication in the Proof Interpretation is that it is impredicative. I discuss the history of that objection, argue that in Brouwer's writings predicativity of implication is ensured…
Our paper is the first study of what one might call "reverse mathematics of explicit fixpoints". We study two methods of constructing such fixpoints for formulas whose principal connective is the intuitionistic Lewis arrow. Our main…
Motivated by a new conjecture on the behavior of bricks, we start a systematic study of minimal $\tau$-tilting infinite algebras. In particular, we treat minimal $\tau$-tilting infinite algebras as a modern counterpart of minimal…
We propose axioms governing the interaction of constructive assertibility and meaningfulness predicates with a self-applicative truth predicate characterized by the T-scheme, and we prove the consistency of the resulting formal system.
We give a new proof of the Gibbard-Satterthwaite Theorem. We construct two topological spaces: one for the space of preference profiles and another for the space of outcomes. We show that social choice functions induce continuous mappings…