English
Related papers

Related papers: A proof-theoretical approach to some extensions of…

200 papers

We introduce and elaborate a novel formalism for the manipulation and analysis of proofs as objects in a global manner. In this first approach the formalism is restricted to first-order problems characterized by condensed detachment. It is…

Logic in Computer Science · Computer Science 2024-10-31 Christoph Wernhard , Wolfgang Bibel

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

Logic in Computer Science · Computer Science 2021-07-06 Bharat Adsul , Saptarshi Sarkar , A. V. Sreejith

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…

Logic · Mathematics 2012-08-28 Tapani Hyttinen , Kaisa Kangas , Jouko Väänänen

The question of defining unique, generally applicable constrained second, and higher-order, derivatives is investigated. It is shown that second-order constrained derivatives obtained via two successive constrained differentiations provide…

Mathematical Physics · Physics 2012-08-14 Tamas Gal

We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Logic in Computer Science · Computer Science 2017-07-19 Thomas Place , Marc Zeitoun

We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the…

Logic · Mathematics 2010-03-23 Lucius T. Schoenbaum

Definite descriptions are first-order expressions that denote unique objects. In this paper, we propose a second-order counterpart, designed to refer to unique relations between objects. We investigate this notion within the framework of…

Logic in Computer Science · Computer Science 2025-08-20 Yaroslav Petrukhin

In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…

Logic · Mathematics 2024-03-27 Henry Towsner

Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…

Logic in Computer Science · Computer Science 2007-05-23 Stefan Ratschan

We establish the strictness of several set quantifier alternation hierarchies that are based on modal logic, evaluated on various classes of finite graphs. This extends to the modal setting a celebrated result of Matz, Schweikardt and…

Logic in Computer Science · Computer Science 2016-03-01 Fabian Reiter

We investigate the expressive power of first-order quantifications in the context of monadic second-order logic over pictures. We show that k+1 set quantifier alternations allow to define a picture language that cannot be defined using k…

Formal Languages and Automata Theory · Computer Science 2012-04-24 Oliver Matz

In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…

Logic · Mathematics 2023-11-15 Jeffry L. Hirst , Carl Mummert

It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate that team semantics offers interesting new possibilities…

Logic · Mathematics 2014-08-19 Antti Kuusisto

A general deformation of the Heisenberg algebra is introduced with two deformed operators instead of just one. This is generalised to many variables, and permits the simultaneous existence of coherent states, and the transposition of…

High Energy Physics - Theory · Physics 2009-10-22 D. B. Fairlie , J. Nuyts

Nonlinear second-order ordinary differential equations are common in various fields of science, such as physics, mechanics and biology. Here we provide a new family of integrable second-order ordinary differential equations by considering…

Exactly Solvable and Integrable Systems · Physics 2020-10-28 Dmitry Sinelshchikov

The recent proposal by Ben-Zvi, Sakellaridis and Venkatesh of a duality in the relative Langlands program, leads, via the process of quantization of Hamiltonian varieties, to a duality theory of branching problems. This often unexpectedly…

Representation Theory · Mathematics 2025-07-28 Wee Teck Gan , Bryan Wang Peng Jun

The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…

Logic · Mathematics 2019-07-08 Valeriy K. Zakharov , Timofey V. Rodionov

The study of generic, non-linear, deformations of Special Relativity parametrized by a high-energy scale $M$, which was carried out at first order in $M$ in Phys.Rev. D86, 084032 (2012), is extended to second order. This can be done…

High Energy Physics - Theory · Physics 2016-10-07 J. M. Carmona , J. L. Cortes , J. J. Relancio

I extend upon the paper by Batalin and Marnelius, in which they show how to construct and quantize a gauge theory from a Hamiltonian system with second class constraints. Among the avenues explored, their technique is analyzed in relation…

High Energy Physics - Theory · Physics 2007-05-23 Michael Chesterman

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…

Artificial Intelligence · Computer Science 2009-05-18 Christoph Benzmueller , Lawrence C. Paulson