TL;DR
It was unknown whether the DTL of Alexandrov spaces is computably enumerable, and model search techniques are used to provide an affirmative answer.
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviours. If the conditions are ideal and the number of observations is sufficient, we can represent these phenomena by a dynamical system, also called a functional digraph, that is to say a graph where each n...
An evaluation engine that is algebra-generic and amenable to differentiation, together with an executable specification of the algebras it can accept is presented, both forward and backward.
The concept of autopoiesis, introduced by Varela and Maturana (1974) to characterize the organizational closure shared by all living systems, has remained an open challenge for rigorous mathematical treatment. This paper traces Varela's formalization program from Spencer-Brown's calculus of distinctions through the Ari...
The aim of this article is to identify existing conceptual gaps, argue for the methodological importance of the ontological shift from the classical “substantial” perspective to a process-oriented one, and formulate the requirements for a future “algebra of life”.
We show that Medvedev's logic of finite problems, a well-known superintuitionistic logic, is undecidable. The key method is a reduction from the periodic tiling problem to non-theoremhood in Medvedev's logic. This settles a longstanding open problem. Using similar techniques, but reducing instead to the ordinary tiling...
Carnap [5] in 1943 noticed that there exist some non-normal valuations that do not respect the usual truth conditions of classical connectives, yet are sound. This finding reveals an asymmetry between the syntax and semantics of classical logic and might be counted as a challenge to the inferentialist program. While se...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
