Related papers: Extensible Proof Systems for Infinite-State System…
The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…
We provide a way to ease the verification of programs whose state evolves monotonically. The main idea is that a property witnessed in a prior state can be soundly recalled in the current state, provided (1) state evolves according to a…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable. We present sufficient conditions on the subsystems matrices such that a switched system is globally exponentially stable under a set…
We consider a coupled bistable N-particle system driven by a Brownian noise, with a strong coupling corresponding to the synchronised regime. Our aim is to obtain sharp estimates on the metastable transition times between the two stable…
In this paper we investigate further the tableaux system for a deontic action logic we presented in previous work. This tableaux system uses atoms (of a given boolean algebra of action terms) as labels of formulae, this allows us to embrace…
This paper tackles the problem of formulating and proving the completeness of focused-like proof systems in an automated fashion. Focusing is a discipline on proofs which structures them into phases in order to reduce proof search…
This paper focuses on the mathematical approaches to the analysis of stability that is a crucial step in the design of dynamical systems. Three methods are presented, namely, absolutely integrable impulse response, Fourier integral, and…
Tabling is a powerful resolution mechanism for logic programs that captures their least fixed point semantics more faithfully than plain Prolog. In many tabling applications, we are not interested in the set of all answers to a goal, but…
This paper deals with the finite-time stabilization of a class of nonlinear infinite-dimensional systems. First, we consider a bounded matched perturbation in its linear form. It is shown that by using a set-valued function, both the…
I explore the relationships between Prawitz's approach to non-monotonic proof-theoretic validity, which I call reducibility semantics, and some later proof-theoretic approaches, which I call standard base semantics and Sandqvist's base…
Cousot and Cousot introduced and studied a general past/future-time specification language, called mu*-calculus, featuring a natural time-symmetric trace-based semantics. The standard state-based semantics of the mu*-calculus is an abstract…
Dependent type theory gives an expressive type system facilitating succinct formalizations of mathematical concepts. In practice, it is mainly used for interactive theorem proving with intensional type theories, with PVS being a notable…
In this paper, we generalize modal $\mu$-calculus to the non-distributive (lattice-based) modal $\mu$-calculus and formalize some scenarios regarding categorization using it. We also provide a game semantics for the developed logic. The…
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…
The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…
The accurate determination of magnetic phase transitions in electronic systems is an important task of solid state theory. While numerically exact results are readily available for model systems such as the half-filled 3D Hubbard model, the…
In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent systems with an arbitrary number of…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
The free energy model can extend the Lattice Boltzmann method to multiphase systems. However, there is a lack of models capable of simulating multicomponent multiphase fluids with partial miscibility. In addition, existing models cannot be…
In the restricted setting of product phase space lattices, we give an alternate proof of P. Linnell's theorem on the finite linear independence of lattice Gabor systems in $L^2(\mathbb R^d)$. Our proof is based on a simple argument from the…