English
Related papers

Related papers: Preservation under Reduced Products in Continuous …

200 papers

We show that H\"older continuity of the gradient is not only a sufficient condition, but also a necessary condition for the existence of a global upper bound on the error of the first-order Taylor approximation. We also relate this global…

Optimization and Control · Mathematics 2020-01-23 Guillaume O. Berger , P. -A. Absil , Raphaël M. Jungers , Yurii Nesterov

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on…

Logic · Mathematics 2019-01-08 Guillermo Badia , Vicent Costa , Pilar Dellunde , Carles Noguera

This paper studies a first-order expansion of a combination C+J of intuitionistic and classical propositional logic, which was studied by Humberstone (1979) and del Cerro and Herzig (1996), from a proof-theoretic viewpoint. While C+J has…

Logic in Computer Science · Computer Science 2022-04-15 Masanobu Toyooka , Katsuhiko Sano

This article gives a summary of the author's Ph.D. dissertation (arXiv:1609.06297). In addition to an overview of notions and results, it also provides sketches of various proofs and simplified presentations of certain abstract results of…

Logic in Computer Science · Computer Science 2018-11-05 Abhisekh Sankaran

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

Logic in Computer Science · Computer Science 2015-05-22 Andreas Teucke , Christoph Weidenbach

Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the…

Logic in Computer Science · Computer Science 2021-03-16 Reijo Jaakkola

We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…

Logic in Computer Science · Computer Science 2023-06-22 G. A. Kavvos

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

This paper defines a new proof- and category-theoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?. The resulting linear/producer/consumer (LPC)…

Logic in Computer Science · Computer Science 2015-02-18 Jennifer Paykin , Steve Zdancewic

For discretisations of hyperbolic conservation laws, mimicking properties of operators or solutions at the continuous (differential equation) level discretely has resulted in several successful methods. While well-posedness for nonlinear…

Numerical Analysis · Mathematics 2019-10-22 Hendrik Ranocha

We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a…

Logic in Computer Science · Computer Science 2017-01-11 Frederik Harwath , Lucas Heimberg , Nicole Schweikardt

We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description…

Logic in Computer Science · Computer Science 2024-12-05 Andrzej Indrzejczak , Nils Kürbis

In this article, we study the continuous and discrete fractional persistence problem which looks for the persistence of properties of a given classical ($\alpha=1$) differential equation in the fractional case (here using fractional…

Numerical Analysis · Mathematics 2016-10-12 Jacky Cresson , Anna Szafrańska

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

Logic in Computer Science · Computer Science 2020-02-19 Amelia Harrison , Vladimir Lifschitz , Miroslaw Truszczynski

The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…

Logic · Mathematics 2024-11-20 Petr Cintula , George Metcalfe , Naomi Tokuda

In this paper, we derive an optimal first-order Taylor-like formula. In a seminal paper [14], we introduced a new first-order Taylor-like formula that yields a reduced remainder compared to the classical Taylor's formula. Here, we relax the…

Numerical Analysis · Mathematics 2023-11-27 Joël Chaskalovic , Franck Assous

We study first and second order theories of relativistic diffusion coupled to hydrodynamics under the approximation, valid at mid-rapidity in the RHIC and LHC, that conserved number densities are much smaller than the entropy density. We…

High Energy Physics - Phenomenology · Physics 2009-11-19 Rajeev S. Bhalerao , Sourendu Gupta

Prawitz suggested expanding a natural deduction system for intuitionistic logic to include rules for classical logic constructors, allowing both intuitionistic and classical elements to coexist without losing their inherent characteristics.…

Logic · Mathematics 2025-04-15 João Rasga , Cristina Sernadas