Non-archimedean tame topology and stably dominated types

Let $V$ be a quasi-projective algebraic variety over a non-archimedean valued field. We introduce topological methods into the model theory of valued fields, define an analogue $\hat {V}$ of the Berkovich analytification $V^{an}$ of $V$, and deduce several new results on Berkovich spaces from it. In particular we show that $V^{an}$ retracts to a finite simplicial complex and is locally contractible, without any smoothness assumption on $V$. When $V$ varies in an algebraic family, we show that the homotopy type of $V^{an}$ takes only a finite number of values. The space $\hat {V}$ is obtained by defining a topology on the pro-definable set of stably dominated types on $V$. The key result is the construction of a pro-definable strong retraction of $\hat {V}$ to an o-minimal subspace, the skeleton, definably homeomorphic to a space definable over the value group with its piecewise linear structure.Comment: Final versio

Conditionals and modularity in general logics

In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics

IST Austria Thesis

Hybrid automata combine finite automata and dynamical systems, and model the interaction of digital with physical systems. Formal analysis that can guarantee the safety of all behaviors or rigorously witness failures, while unsolvable in general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking, assisted theorem proving. Nevertheless, very few methods have addressed the time-unbounded reachability analysis of hybrid automata and, for current sound and automatic tools, scalability remains critical. We develop methods for the polyhedral abstraction of hybrid automata, which construct coarse overapproximations and tightens them incrementally, in a CEGAR fashion. We use template polyhedra, i.e., polyhedra whose facets are normal to a given set of directions. While, previously, directions were given by the user, we introduce (1) the first method for computing template directions from spurious counterexamples, so as to generalize and eliminate them. The method applies naturally to convex hybrid automata, i.e., hybrid automata with (possibly non-linear) convex constraints on derivatives only, while for linear ODE requires further abstraction. Specifically, we introduce (2) the conic abstractions, which, partitioning the state space into appropriate (possibly non-uniform) cones, divide curvy trajectories into relatively straight sections, suitable for polyhedral abstractions. Finally, we introduce (3) space-time interpolation, which, combining interval arithmetic and template refinement, computes appropriate (possibly non-uniform) time partitioning and template directions along spurious trajectories, so as to eliminate them. We obtain sound and automatic methods for the reachability analysis over dense and unbounded time of convex hybrid automata and hybrid automata with linear ODE. We build prototype tools and compare—favorably—our methods against the respective state-of-the-art tools, on several benchmarks

Zero-one laws with respect to models of provability logic and two Grzegorczyk logics

It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. Therefore, many properties of models, such as having an even number of elements, cannot be expressed in the language of first-order logic. Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5 and for frames corresponding to S4 and S5. In this paper, we prove zero-one laws for provability logic and its two siblings Grzegorczyk logic and weak Grzegorczyk logic, with respect to model validity. Moreover, we axiomatize validity in almost all relevant finite models, leading to three different axiom systems