Related papers: Sealing from Iterability
Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding -- to the…
We prove the non-abelian Poincare lemma in higher gauge theory in two different ways. The first method uses a result by Jacobowitz which states solvability conditions for differential equations of a certain type. The second method extends a…
In various models of set theory, we consider covering Aleph_1 x Aleph_1 rectangles by countably many smooth curves, and we study differentiable isomorphisms between Aleph_1-dense sets of reals.
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).
The use of interpolants in verification is gaining more and more importance. Since theories used in applications are usually obtained as (disjoint) combinations of simpler theories, it is important to modularly re-use interpolation…
We prove that any countable support iteration formed with posets with $\omega_2$-p.i.c.\ has $\omega_2$-c.c., assuming CH in the ground model and assuming also that $\omega_1$ is not collapsed. This improves earlier results of Shelah by…
We propose a local model-checking proof system for a fragment of CTL. The rules of the proof system are motivated by the well-known fixed-point characterisation of CTL based on unfolding of the temporal operators. To guarantee termination…
We investigate the relationship between coseparable and semisimple corings. In particular we prove that a coring over a separable algebra is coseparable if and only if it is absolutely semisimple.
We present a syntactic cut-elimination procedure for the alternation-free fragment of the modal mu-calculus. Cut reduction is carried out within a cyclic proof system, where proofs are finitely branching but may be non-wellfounded. The…
A proof procedure, in the spirit of the sequent calculus, is proposed to check the validity of entailments between Separation Logic formulas combining inductively defined predicates denoted structures of bounded tree width and theory…
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.
We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…
The notion of clause set cycle abstracts a family of methods for automated inductive theorem proving based on the detection of cyclic dependencies between clause sets. By discerning the underlying logical features of clause set cycles, we…
In this position paper, we propose a reasoning framework that can model the reasoning process underlying natural language inferences. The framework is based on the semantic tableau method, a well-studied proof system in formal logic. Like…
Attestation means providing evidence that a remote target system is worthy of trust for some sensitive interaction. Although attestation is already used in network access control, security management, and trusted execution environments, it…
Let X be a projective, equidimensional, singular scheme over an algebraically closed field. Then the existence of a geometric smoothing (i.e. a family of deformations of X over a smooth base curve whose generic fibre is smooth) implies the…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…
Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…