相关论文: Generalisation of proof simulation procedures for …
In [Bailo, Carrillo, Hu. SIAM J. Appl. Math. 2023] the authors introduce a finite-volume method for aggregation-diffusion equations with non-linear mobility. In this paper we prove convergence of this method using an Aubin--Simons…
We study the averaging method for flows perturbed by a dynamical system preserving an infinite measure. Motivated by the case of perturbation by the collision dynamic on the finite horizon $\mathbb Z$-periodic Lorentz gas and in view of…
In the context of natural deduction for propositional classical logic, with classicality given by the inference rule reductio ad absurdum, we investigate the De Morgan translation of disjunction in terms of negation and conjunction. Once…
The method of proof of Balog and Ruzsa and the large sieve of Linnik are used to investigate the behaviour of the $L^{1}$ norm of a wide class of exponential sums over the square-free integers and the primes. Further, a new proof of the…
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; 2) there are…
We study a model of a general compressible viscous fluid subject to the Coulomb friction law boundary condition. For this model, we introduce a dissipative formulation and prove the existence of dissipative solutions. The proof of this…
We consider certain infectious logics (Sfde, dSfde, K3w, and PWK) and several their non-infectious modifications, including two new logics, reformulate previously constructed natural deduction systems for them (or present such systems from…
We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…
We pursue the group theoretical method to study Isgur-Wise functions. We apply the general formalism, formerly applied to the baryon case j^P = 0^+ (for \Lambda_b -> \Lambda_c \ell \nu), to mesons with j^P = 1/2^-, i.e. $\overline{B} ->…
Abductive logic programming offers a formalism to declaratively express and solve problems in areas such as diagnosis, planning, belief revision and hypothetical reasoning. Tabled logic programming offers a computational mechanism that…
We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…
We present an adaptation, based on program extraction in elementary linear logic, of Krivine & Leivant's system FA_2. This system allows to write higher-order equations in order to specify the computational content of extracted programs.…
We introduce a method of verifying termination of logic programs with respect to concrete queries (instead of abstract query patterns). A necessary and sufficient condition is established and an algorithm for automatic verification is…
In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…
Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen…
This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of `maximal formula', `segment' and `maximal segment' suitable to the system, and gives…
In this article, we deal with the uniform effective disjunction property and the uniform effective interpolation property, which are weaker versions of the classical effective disjunction property and the effective interpolation property.\\…
Tetravalent modal logic (T ML) was introduced by Font and Rius in 2000; and it is an expansion of the Belnap-Dunn four{valued logic FOUR, a logical system that is well{known for the many applications it has been found in several fields.…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We study the finite frame property of some extensions of Fitting, Marek, and Truszczy\'nski's pure logic of necessitation $\mathbf{N}$. For any natural numbers $m, n$, we introduce the logic $\mathbf{N}^+\mathbf{A}_{m, n}$ by adding the…