Related papers: Proof-theoretic methods in quantifier-free definab…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
The irreducible unitary representations of the Banach Lie group $U_0(\H)$ (which is the norm-closure of the inductive limit $\cup_k U(k)$) of unitary operators on a separable Hilbert space $\H$, which were found by Kirillov and Ol'shanskii,…
In a series of papers, we have shown that from the representatio theory of a compact groupoid one can reconstruct the groupoid using the procedure similar to the Tannaka-Krein duality for compact groups. In this part we study continuous…
We identify new families of duality-invariant theories of electrodynamics. We achieve this in two different ways. On the one hand, we present an algorithm to construct a one-parameter family of exactly duality-invariant theories from a…
We study algorithmic complexity and expressive power of fusion grammars, a novel formalism introduced in [Kreowski, Kuske, and Lye 2017], which extends hyperedge replacement grammars. In the first part of the work, we prove that the…
In these notes we propose a new, simpler proof system for first-order matching logic with application and definedness. The new proof system is inspired by Tarski's axiomatization for first order-logic with equality (simplified by Kalish and…
The method K\"urbis used to formalise definite descriptions with a binary quantifier I, such that I$x[F,G]$ indicates `the F is G', is examined and improved upon in this work. K\"urbis first looked at I in intuitionistic logic and its…
The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…
Standard methods in non-linear analysis are used to show that there exists a parabolic branching of solutions of the Lichnerowicz-York equation with an unscaled source. We also apply these methods to the extended conformal thin sandwich…
Cyclic proof theory breaks tradition by allowing certain infinite proofs: those that can be represented by a finite graph, while satisfying a soundness condition. We reconcile cyclic proofs with traditional finite proofs: we extend abstract…
In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic. The main features of the resulting logic, we call InqLTL, are the intuitionistic interpretation of implication and the Boolean semantics of…
We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…
A new way of encoding a non-self-adjoint Jacobi matrix $J$ by a spectral measure of $|J|$ together with a phase function was described by Pushnitski--\v Stampach in the bounded case. We present another perspective on this correspondence,…
Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…
We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…
The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…
In response to a concern raised by Horty, this paper develops a two-tiered, preference-based semantic framework for modeling defeasible conditional obligations. The paper extends a Hansson-Lewis style preference semantics for dyadic deontic…
We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal)…
We consider a 2-valued non-deterministic connective $\wedge \hskip-5.5pt \vee$ defined by the table resulting from the entry-wise union of the tables of conjunction and disjunction. Being half conjunction and half disjunction we named it…
A cyclic proof system gives us another way of representing inductive definitions and efficient proof search. In 2011 Brotherston and Simpson conjectured the equivalence between the provability of the classical cyclic proof system and that…