English
Related papers

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

200 papers

Quantification, i.e., the task of training predictors of the class prevalence values in sets of unlabeled data items, has received increased attention in recent years. However, most quantification research has concentrated on developing…

Machine Learning · Computer Science 2023-10-16 Mirko Bunse , Alejandro Moreo , Fabrizio Sebastiani , Martin Senz

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes…

Quantum Physics · Physics 2019-05-28 Alessandro Bisio , Paolo Perinotti

We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf's Theorem and known concepts in finite combinatorics, like senders and…

Computational Complexity · Computer Science 2012-09-06 Nerio Borges

While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking. Since the…

Logic in Computer Science · Computer Science 2017-01-19 Quentin Heath , Dale Miller

Arguments on the need, and usefulness, of going beyond the usual Hausdorff-Kuratowski-Bourbaki, or in short, HKB concept of topology are presented. The motivation comes, among others, from well known {\it topological type processes}, or in…

General Mathematics · Mathematics 2010-01-13 Elemer E Rosinger , Jan Harm van der Walt

This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…

Logic in Computer Science · Computer Science 2018-12-03 Ioana Leustean , Natalia Moanga , Traian Florin Serbanuta

Herbrand's Theorem is a fundamental result in mathematical logic which provides a reduction of first-order formulas satisfied by a universal class to formulas free of existential quantifiers. In this work, a simpler and self-contained…

Logic · Mathematics 2025-12-24 Mariana Badano

$\Omega$-rule was introduced by W. Buchholz to give an ordinal-free cut-elimination proof for a subsystem of analysis with $\Pi^{1}_{1}$-comprehension. His proof provides cut-free derivations by familiar rules only for arithmetical…

Logic · Mathematics 2011-03-15 R. Akiyoshi , G. Mints

A general class of non-Markov, supercritical Gaussian branching particle systems is introduced and its long-time asymptotics is studied. Both weak and strong laws of large numbers are developed with the limit object being characterized in…

Probability · Mathematics 2018-07-30 Michael A. Kouritzin , Khoa Lê , Deniz Sezer

This is an attempt to create a consistent and non-trivial extension of quantum theory, describing in detail the quantum measurement process. A tentative but concrete model is presented, based on the concept of multiple…

Quantum Physics · Physics 2007-05-23 Jose L Balduz

Although classical mechanics and quantum mechanics are separate disciplines, we live in a world where Planck's constant \hbar>0, meaning that the classical and quantum world views must actually {\it coexist}. Traditionally, canonical…

Quantum Physics · Physics 2015-06-04 John R. Klauder

Intuitionistic first-order logic extended with a restricted form of Markov's principle is constructive and admits a Curry-Howard correspondence, as shown by Herbelin. We provide a simpler proof of that result and then we study…

Logic in Computer Science · Computer Science 2018-11-13 Federico Aschieri , Matteo Manighetti

A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…

Logic · Mathematics 2019-10-01 Fausto Barbero

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

Logic in Computer Science · Computer Science 2022-01-11 Thomas Colcombet , Sam van Gool , Rémi Morvan

We present a method of deriving linearizing transformations for a class of second order nonlinear ordinary differential equations. We construct a general form of a nonlinear ordinary differential equation that admits Bernoulli equation as…

Exactly Solvable and Integrable Systems · Physics 2017-07-05 R Mohanasubha , V. K. Chandrasekar , M. Senthilvelan

As suggested by the title, it has recently become clear that theorems of Nonstandard Analysis (NSA) give rise to theorems in computability theory (no longer involving NSA). Now, the aforementioned discipline divides into classical and…

Logic · Mathematics 2017-01-19 Sam Sanders

The main aim of this paper is to promote a certain style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose, we provide a reasonably direct justification for coinductive proofs…

Logic in Computer Science · Computer Science 2019-05-24 Łukasz Czajka

We establish a quantisation of corner-degenerate symbols, here called Mellin-edge quantisation, on a manifold $M$ with second order singularities. The typical ingredients come from the "most singular" stratum of $M$ which is a second order…

Analysis of PDEs · Mathematics 2012-02-01 Bert-Wolfgang Schulze , Yawei Wei

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in…

Logic in Computer Science · Computer Science 2025-03-19 Oskar Fiuk , Emanuel Kieronski

There are several extensions of the classical Banach Fixed Point Theorem in technical literature. A branch of generalizations replaces usual contractivity by weaker but still effective assumptions. Our note follows this stream, presenting…

Functional Analysis · Mathematics 2016-05-13 Mihály Bessenyei