Related papers: Positive Robinson theories and h-maximal models

We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We…

The relationships between port-Hamiltonian systems modeling and the notion of monotonicity are explored. The earlier introduced notion of incrementally port-Hamiltonian systems is extended to maximal cyclically monotone relations, together…

This is the author's Ph.D. Thesis. It contains results from four years of research into realizability and categorical logic. The main subjects are the axiomatisation of realizable propositions, and a characterization of realizability…

Set systems of finite VC dimension are frequently used in applications relating to machine learning theory and statistics. Two simple types of VC classes which have been widely studied are the maximum classes (those which are extremal with…

This paper is a follow-up to "Models of PT${}^-$ with internal induction for total formulae." We give a strenghtening of the main result on the semantical non-conservativity of the theory of PT${}^-$ with internal induction for total…

In this paper, we focus on some models in rational homotopy theory, Sullivan model, Quillen model, C_\infty model, and L_\infty model. We give some connections between them. As an application, we prove the Torus Rank Conjecture.

In our recent work \cite{StojnicHopBnds10} we looked at a class of random optimization problems that arise in the forms typically known as Hopfield models. We viewed two scenarios which we termed as the positive Hopfield form and the…

This survey contains the main results in rational homotopy, from the beginning to the most recent ones. It makes the status of the art, gives a short presentation of some areas where rational homotopy has been used, and contains a lot of…

This is the fourth in a series of papers extending Martin-L\"of's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of…

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…

We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly…

We give algebraic conditions about a finite algebra $B$ over a perfect field of positive characteristic, which are equivalent to the companionability of the theory of fields with "$B$-operators" (i.e. the operators coming from homomorphisms…

We examine a previouly introduced attractor neural network model that explains the persistent activities of neurons in the anterior ventral temporal cortex of the brain. In this model, the coexistence of several attractors including…

We introduce the class of functions positively associated with a linear operator. We describe these classes for several integral operators including the $q$-cosine transform and the spherical Radon transform. We show that positively…

In the first part of the work (Sections 2-6) a special attention is given to relative separation axioms and relative connectedness, in particular, many relative versions of p-T_0, p-T_1, p-T_2, (i,j)- and p-regularities, (i,j)- and…

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

General analytic energy bounds are derived for N-boson systems governed by semirelativistic Hamiltonians of the form H=\sum_{i=1}^N \sqrt(p_i^2+m^2) + \sum_{1=i<j}^N V(r_{ij}), where V(r) is a static attractive pair potential. A…

The reinforcement learning research area contains a wide range of methods for solving the problems of intelligent agent control. Despite the progress that has been made, the task of creating a highly autonomous agent is still a significant…

Matrix models are a promising candidate for a nonperturbative formulation of the superstring theory. It is possible to study how the standard model and other phenomenological models appear from the matrix model, and estimate the probability…