Related papers: Realizing realizability results with classical con…
A model of story generation recently proposed by Riedl and Young casts it as planning, with the additional condition that story characters behave intentionally. This means that characters have perceivable motivation for the actions they…
This is the same version that was previously only on my home page. We give a description of geometric realization which makes it evident that it commutes with products. A similar approach is used to treat cyclic sets. Our approach is…
We present two possible criteria quantifying the degree of classicality of an arbitrary (finite dimensional) dynamical system. The inputs for these criteria are the classical dynamical structure of the system together with the quantum and…
This chapter does not deal with specific tools and techniques for managing complex systems, but proposes some basic concepts that help us to think and speak about complexity. We review classical thinking and its intrinsic drawbacks when…
We introduce a principle of local collection for compositional truth predicates and show that it is conservative over the classically compositional theory of truth in the arithmetical setting. This axiom states that upon restriction to…
We explain how recent developments in the fields of realisability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity. This…
Classical evaluations of configurations of intertwined quantum contexts induce relations, such as true-implies-false, true-implies-true, but also nonseparability among the input and output terminals. When combined, these exploitable…
Under the assumption that every material object can ultimately be described by quantum theory, we ask how a probe system evolves in a device prepared and kept in a superposition state of values of its classical parameter. We find that,…
In this paper, we present a unified approach using model category theory and an associative law to compare some classic variants of the geometric realization functor.
The solution of sequences of shifted linear systems is a classic problem in numerical linear algebra, and a variety of efficient methods have been proposed over the years. Nevertheless, there still exist challenging scenarios witnessing a…
Inferring causal models from observed correlations is a challenging task, crucial to many areas of science. In order to alleviate the computational effort when sifting through possible causal explanations for some given observations, it is…
In 2009, J. Wood proved that Frobenius bimodules have the extension property for symmetrized weight compositions. More generally, it was later shown that having a cyclic socle is sufficient for satisfying the property, while the necessity…
The aim of this paper is to give mathematical account of an argument of David Lewis in Parts of Classes in defense of universalism in mereology. Specifically we study how to extend models of Core Mereology (following Achille Varzi's…
We introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom systems for the logics, and prove their soundness and…
We prove that under certain combinatorial conditions, the realization spaces of line arrangements on the complex projective plane are connected. We also give several examples of arrangements with eight, nine and ten lines which have…
The linearization of complex ordinary differential equations is studied by extending Lie's criteria for linearizability to complex functions of complex variables. It is shown that the linearization of complex ordinary differential equations…
Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems.…
The Whitney extension theorem is a classical result in analysis giving a necessary and sufficient condition for a function defined on a closed set to be extendable to the whole space with a given class of regularity. It has been adapted to…
The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…
A construction of the magic square, and hence of exceptional Lie algebras, is carried out using trialities rather than division algebras. By way of preparation, a comprehensive discussion of trialities is given, incorporating a number of…