Review by: Jan Reimann The Bulletin of Symbolic Logic, Volume 19, Issue 3, Page 397-399, September 2013.

t. 1. Filosofii︠a︡ ; Izbrannye predislovii︠a︡ ; I︠A︡zykoznanie -- t. 2. Filologii︠a︡ ; Vospominanii︠a︡ i nabli︠u︡denii︠a︡ ; Pami︠a︡ti uchiteleĭ i kolleg ; Prilozhenie : A.N. Kolmogorov, semioticheskie poslanii︠a︡.

In the present paper we discuss: a) how Hilbert’s unification program failed completely, and b) we outline a new electron model based on Helmholtz’s electron vortex and Kolmogorov theory of turbulence. Novelty aspect: we discuss among other things, electron capture event, and von Karman vortex street. We also discuss a new model of origination of charge and matter. This paper is a sequel to a preceding paper on similar theme.

Propensities are presented as a generalization of classical determinism. They describe a physical reality intermediary between Laplacian determinism and pure randomness, such as in quantum mechanics. They are characterized by the fact that their values are determined by the collection of all actual properties. It is argued that they do not satisfy Kolmogorov axioms; other axioms are proposed.

In 1933 Godel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that Godel's provability calculus is nothing but the forgetful projection of LP. This also achieves Godel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int (...) which resisted formalization since the early 1930s. LP may be regarded as a unified underlying structure for intuitionistic, modal logics, typed combinatory logic and λ-calculus. (shrink)

Correlations of spins in a system of entangled particles are inconsistent with Kolmogorov’s probability theory (KPT), provided the system is assumed to be non-contextual. In the Alice–Bob EPR paradigm, non-contextuality means that the identity of Alice’s spin (i.e., the probability space on which it is defined as a random variable) is determined only by the axis $\alpha _{i}$ chosen by Alice, irrespective of Bob’s axis $\beta _{j}$ (and vice versa). Here, we study contextual KPT models, with two properties: (1) (...) Alice’s and Bob’s spins are identified as $A_{ij}$ and $B_{ij}$ , even though their distributions are determined by, respectively, $\alpha _{i}$ alone and $\beta _{j}$ alone, in accordance with the no-signaling requirement; and (2) the joint distributions of the spins $A_{ij},B_{ij}$ across all values of $\alpha _{i},\beta _{j}$ are constrained by fixing distributions of some subsets thereof. Of special interest among these subsets is the set of probabilistic connections, defined as the pairs $\left( A_{ij},A_{ij'}\right) $ and $\left( B_{ij},B_{i'j}\right) $ with $\alpha _{i}\not =\alpha _{i'}$ and $\beta _{j}\not =\beta _{j'}$ (the non-contextuality assumption is obtained as a special case of connections, with zero probabilities of $A_{ij}\not =A_{ij'}$ and $B_{ij}\not =B_{i'j}$ ). Thus, one can achieve a complete KPT characterization of the Bell-type inequalities, or Tsirelson’s inequalities, by specifying the distributions of probabilistic connections compatible with those and only those spin pairs $\left( A_{ij},B_{ij}\right) $ that are subject to these inequalities. We show, however, that quantum-mechanical (QM) constraints are special. No-forcing theorem says that if a set of probabilistic connections is not compatible with correlations violating QM, then it is compatible only with the classical–mechanical correlations. No-matching theorem says that there are no subsets of the spin variables $A_{ij},B_{ij}$ whose distributions can be fixed to be compatible with and only with QM-compliant correlations. (shrink)

ABSTRACT In 1933 Gödel introduced an axiomatic system, currently known as S4, for a logic of an absolute provability, i.e. not depending on the formalism chosen ([God 33]). The problem of finding a fair provability model for S4 was left open. The famous formal provability predicate which first appeared in the Gödel Incompleteness Theorem does not do this job: the logic of formal provability is not compatible with S4. As was discovered in [Art 95], this defect of the formal provability (...) predicate can be bypassed by replacing hidden quantifiers over proofs by proof polynomials in a certain finite basis. The resulting Logic of Proofs enjoys a natural arithmetical semantics and provides an intended provability model for S4, thus answering a question left open by Gödel in 1933. Proof polynomials give an intended semantics for some other constructions based on the concept of provability, including intuitionistic logic with its Brouwer- Heyting- Kolmogorov interpretation, ?-calculus and modal ?-calculus. In the current paper we demonstrate how the intuitionistic propositional logic Int can be directly realized by proof polynomials. It is shown, that Int is complete with respect to this proof realizability. (shrink)

Explores intellectual and philosophical evolution of German philosopher Martin Heidegger, focusing on period after World War II. Analyzes how Heidegger s ideas, particularly his notion of being, influenced and were influenced by postwar context, including confrontation with Nazism and emergence of new philosophical currents. Argues that Heidegger s work offers relevant insights for contemporary philosophical debates and calls for a critical dialogue with his legacy. Discusses Heidegger s philosophy in the context of French and German philosophical schools, highlighting relevance of (...) his ideas and impact they had on contemporary philosophy. (shrink)

We investigate the initial segment complexity of random reals. Let K denote prefix-free Kolmogorov complexity. A natural measure of the relative randomness of two reals α and β is to compare complexity K and K. It is well-known that a real α is 1-random iff there is a constant c such that for all n, Kn−c. We ask the question, what else can be said about the initial segment complexity of random reals. Thus, we study the fine behaviour of (...) K for random α. Following work of Downey, Hirschfeldt and LaForte, we say that αK β iff there is a constant such that for all n, . We call the equivalence classes under this measure of relative randomness K-degrees. We give proofs that there is a random real α so that lim supn K−K=∞ where Ω is Chaitin's random real. One is based upon work of Solovay, and the other exploits a new idea. Further, based on this new idea, we prove there are uncountably many K-degrees of random reals by proving that μ=0. As a corollary to the proof we can prove there is no largest K-degree. Finally we prove that if n ≠ m then the initial segment complexities of the natural n- and m-random sets and Ω︀) are different. The techniques introduced in this paper have already found a number of other applications. (shrink)

We use a method suggested by Kolmogorov complexity to examine some relations between Kolmogorov complexity and noncomputability. In particular we show that the method consistently gives us more information than conventional ways of demonstrating noncomputability . Also, many sets which are awkward to embed into the halting problem are easily shown noncomputable. We also prove a gap-theorem for outputting consecutive integers and find, for a given length n, a statement of length n with maximal proof length.

Для юристов-практиков и разработчиков законов, студентов, аспирантов и преподавателей юридических вузов и факультетов.

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A. We determine exactly how hard it is to enumerate the Kolmogorov function, (...) which assigns to each string x its Kolmogorov complexity: • For every underlying universal machine U, there is a constant a such that C is k(n)-enumerable only if k(n) ≥ n/a for almost all n. • For any given constant k, the Kolmogorov function is k-enumerable relative to an oracle A if and only if A is at least as hard as the halting problem. • There exists an r.e., Turing-incomplete set A such for every non-decreasing and unbounded recursive function k, the Kolmogorov function is k(n)-enumerable relative to A. The last result is obtained by using a relativizable construction for a nonrecursive set A relative to which the prefix-free Kolmogorov complexity differs only by a constant from the unrelativized prefix-free Kolmogorov complexity. Although every 2-enumerator for C is Turing hard for K, we show that reductions must depend on the specific choice of the 2-enumerator and there is no bound on the quantity of their queries. We show our negative results even for strong 2-enumerators as an oracle where the querying machine for any x gets directly an explicit list of all hypotheses of the enumerator for this input. The limitations are very general and we show them for any recursively bounded function g: • For every Turing reduction M and every non-recursive set B, there is a strong 2-enumerator f for g such that M does not Turing reduce B to f. • For every non-recursive set B, there is a strong 2-enumerator f for g such that B is not wtt-reducible to f. Furthermore, we deal with the resource-bounded case and give characterizations for the class ${\rm S}_{2}^{{\rm P}}$ introduced by Canetti and independently Russell and Sundaram and the classes PSPACE, EXP. • ${\rm S}_{2}^{{\rm P}}$ is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time tt-reduction which reduces A to every strong 2-enumerator for g. • PSPACE is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time Turing reduction which reduces A to every strong 2-enumerator for g. Interestingly, g can be taken to be the Kolmogorov function for the conditional space bounded Kolmogorov complexity. • EXP is the class of all sets A for which there is a polynomially bounded function g and a machine M which witnesses A ∈ PSPACEf for all strong 2-enumerators f for g. Finally, we show that any strong O(log n)-enumerator for the conditional space bounded Kolmogorov function must be PSPACE-hard if P = NP. (shrink)

Alongside concerns for animal welfare, concerns for land, water, and climate are undermining established food identities in many parts of the world. In Aotearoa New Zealand, agrifood relations are bound tightly into national identities and the materialities of export dependence on dairying and agriculture more widely. Dairy/ing identities have been central to national development projects and the politics that underpin them for much of New Zealand’s history. They are central to an intransigent agrifood political ontology. For the last decade, however, (...) they have been challenged by the identity politics of ethical food consumption. This paper explores the ensuing contests and asks how they are reshaping agrifood identities. We draw on interviews with 15 participants in Aotearoa New Zealand who have made dietary transitions that reduce or exclude dairy products. Our aim is not to identify a new post-dairying identity or claim a reconfigured national identity, but to examine the collision of production-consumption values in the context of a dominant place-based food identity. We ask how participants navigate contradictory commitments to becoming ‘good environmental citizens’ whilst remaining ‘good national citizens’. The paper offers insights for examining similar struggles elsewhere and the potential to shift agrifood relations and undermine entrenched political ontologies through ethical food consumption values. (shrink)

We reconsider some classical natural semantics of integers in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of “self-enumerated system” that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained (...) by such effectivizations and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations . This contrasts with the well-known fact that usual Kolmogorov complexity does not depend on the chosen arithmetic representation of integers, let it be in any base n ≥ 2 or in unary. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics. (shrink)

The ongoing debate within neuroethics concerning the degree to which neuromodulation such as deep brain stimulation (DBS) changes the personality, identity, and agency (PIA) of patients has paid relatively little attention to the perspectives of prospective patients. Even less attention has been given to pediatric populations. To understand patients’ views about identity changes due to DBS in obsessive-compulsive disorder (OCD), the authors conducted and analyzed semistructured interviews with adolescent patients with OCD and their parents/caregivers. Patients were asked about projected impacts (...) to PIA generally due to DBS. All patient respondents and half of caregivers reported that DBS would impact patient self-identity in significant ways. For example, many patients expressed how DBS could positively impact identity by allowing them to explore their identities free from OCD. Others voiced concerns that DBS-related resolution of OCD might negatively impact patient agency and authenticity. Half of patients expressed that DBS may positively facilitate social access through relieving symptoms, while half indicated that DBS could increase social stigma. These views give insights into how to approach decision-making and informed consent if DBS for OCD becomes available for adolescents. They also offer insights into adolescent experiences of disability identity and “normalcy” in the context of OCD. (shrink)

An infinite binary sequence X is Kolmogorov–Loveland random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounded gain in the limit while betting successively on bits of X. A sequence X is KL-stochastic if there is no computable non-monotonic selection rule that selects from X an infinite, biased sequence.One of the major open problems in the field of effective randomness is whether Martin-Löf randomness is the same as KL-randomness. Our (...) first main result states that KL-random sequences are close to Martin-Löf random sequences in so far as every KL-random sequence has arbitrarily dense subsequences that are Martin-Löf random. A key lemma in the proof of this result is that for every effective split of a KL-random sequence at least one of the halves is Martin-Löf random. However, this splitting property does not characterize KL-randomness; we construct a sequence that is not even computably random such that every effective split yields two subsequences that are 2-random. Furthermore, we show for any KL-random sequence A that is computable in the halting problem that, first, for any effective split of A both halves are Martin-Löf random and, second, for any computable, nondecreasing, and unbounded function g and almost all n, the prefix of A of length n has prefix-free Kolmogorov complexity at least n−g. Again, the latter property does not characterize KL-randomness, even when restricted to left-r.e. sequences; we construct a left-r.e. sequence that has this property but is not KL-stochastic and, in fact, is not even Mises–Wald–Church stochastic.Turning our attention to KL-stochasticity, we construct a non-empty class of KL-stochastic sequences that are not weakly 1-random; by the usual basis theorems we obtain such sequences that in addition are left-r.e., are low, or are of hyperimmune-free degree.Our second main result asserts that every KL-stochastic sequence has effective dimension 1, or equivalently, a sequence cannot be KL-stochastic if it has infinitely many prefixes that can be compressed by a factor of α<1. This improves on a result by Muchnik, who has shown that were they to exist, such compressible prefixes could not be found effectively. (shrink)

The place occupied by Kant’s philosophical ideas in the reflections of the Russian philosopher, Nikolay Strakhov, needs further study. The material for a historical-philosophical reconstruction of Strakhov’s reception of Kant’s philosophy is the Russian thinker’s home library catalogue, his correspondence and his own philosophical works. Among Strakhov’s interlocutors were not only philosophers and natural scientists, but also writers, including Fyodor Dostoevsky, Leo Tolstoy and Afanasy Fet, who in many ways determined the cultural and intellectual horizon of the epoch. The many (...) years of correspondence with the last two writers went a long way to shape and develop Strakhov’s perception of Kant as a thinker. Indeed, without a virtual dialogue with Kant no modern philosophical system can be built. Strakhov’s reflections on the Kantian style of thinking, adoption of Kantian criticism as the model of epistemic analysis in many ways determined the features of his own philosophical work and became a catalyst of renewed interest in Russia in the Kantian philosophy in the last third of the nineteenth century. (shrink)

Video streaming has become very popular among game enthusiasts. Live streams of computer games, where there is the possibility of communi­cation, are developing as community meeting places; a number of social scientists are calling this a trend towards new online “third places”. To­day’s debate draws attention to the reproduction of a participation culture trough streaming, in the space of which everyone can express themselves creatively, share their opinion, experiences, and information. At the same time, there is a tendency towards the (...) capitalist appropriation of streaming by media businesspersons who stimulate the monetization of participation. Investigating the “sociality of streaming”, the authors highlight the supplementation of the “Let’s Play” discourse with topics from the current agenda, understanding live streams as public media arenas. In the public arenas of computer game live streams, the dramatization and selection of global or local news information in a specific media format takes place. The article demonstrates this phenomenon using the example of the corona­virus, the most prominent topic of spring 2020. The pandemic vocabulary appears in different sections of Twitch game streams, such as titles, audio/ video content, and the chat. Banter and obscene vocabulary are charac­teristic of the game stream space, however, this is combined with charity fund-raising broadcasts in support of doctors. ­. (shrink)

In this paper, we suggest the broader concept of proof-event, introduced by Joseph Goguen, as a fundamental methodological tool for studying proofs in history of mathematics. In this framework, proof is understood not as a purely syntactic object, but as a social process that involves at least two agents; this highlights the communicational aspect of proving. We claim that historians of mathematics essentially study proof-events in their research, since the mathematical proofs they face in the extant sources involve many informal (...) components, often not completely formalizable, and convey some kind of semantic content calling for understanding and verification. We illustrate the application of this methodological approach in some outstanding historical cases, paying particular attention to the process of proof interpretation that makes a proof-event alive. Finally, we suggest a classification of proof-events, according to the conditions imposed upon problem-solving. This enables us to speak about broad classes of proof-events in history of mathematics that share a common characteristic. (shrink)