English
Related papers

Related papers: Coinductive Validity

200 papers

We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…

Logic in Computer Science · Computer Science 2020-06-17 Harley Eades , Dominic Orchard

It is known that intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth functions. We extend this generalized Kripke semantics to first-order logic, and study how…

Logic · Mathematics 2022-05-13 Naosuke Matsuda , Kento Takagi

Null Hypothesis Statistical Testing is a dominant framework for conducting statistical analysis across the sciences. There remains considerable debate as to whether, and under what circumstances, evidence can be said to be confirmatory of a…

Statistics Theory · Mathematics 2024-05-28 Reid Dale

We offer the proofs that complete our article introducing the propositional calculus called semi-intuitionistic logic with strong negation.

Logic · Mathematics 2017-09-01 Juan Manuel Cornejo , Ignacio Viglizzo

Goedel's results have had a great impact in diverse fields such as philosophy, computer sciences and fundamentals of mathematics. The fact that the rule of mathematical induction is contradictory with the rest of clauses used by Goedel to…

General Mathematics · Mathematics 2007-05-23 Diego Saa

In this note, we establish the validity of a conjecture recently proposed in Mathematics Magazine and connect it to the existing interesting results

Probability · Mathematics 2025-04-22 Yaakov Malinovsky

Coinductive reasoning about infinitary structures such as streams is widely applicable. However, practical frameworks for developing coinductive proofs and finding reasoning principles that help structure such proofs remain a challenge,…

Programming Languages · Computer Science 2020-01-13 Yannick Zakowski , Paul He , Chung-Kil Hur , Steve Zdancewic

Theorem provers are tools that help users to write machine readable proofs. Some of this tools are also interactive. The need of such softwares is increasing since they provide proofs that are more certified than the hand written ones. Agda…

Logic in Computer Science · Computer Science 2020-02-18 Luca Ciccone

Classical logic is embedded into constructive logic, through a definition of the classical connectives and quantifiers in terms of the constructive ones.

Logic in Computer Science · Computer Science 2016-01-11 Gilles Dowek

We formulate the Hauptvermutung of Causal Set Theory in two mathematically well-defined but different ways one of which turns out to be wrong and the other one turns out to be true. A further result is that the Hauptvermutung is true if we…

Differential Geometry · Mathematics 2025-12-30 Olaf Müller

This article contains a proposal to add coinduction to the computational apparatus of natural language understanding. This, we argue, will provide a basis for more realistic, computationally sound, and scalable models of natural language…

Computation and Language · Computer Science 2020-12-11 Wlodek W. Zadrozny

This short note proposes a symbolic approach for representing and reasoning about quantum circuits using complex, vector or matrix-valued Boolean expressions. A major benefit of this approach is that it allows us to directly borrow the…

Quantum Physics · Physics 2020-10-08 Mingsheng Ying , Zhengfeng Ji

We study a new proof principle in the context of constructive Zermelo-Fraenkel set theory based on what we will call "non-deterministic inductive definitions". We give applications to formal topology as well as a predicative justification…

Logic · Mathematics 2012-09-17 Benno van den Berg

A quantum-like description of human decision process is developed, and a heuristic argument supporting the theory as sound phenomenology is given. It is shown to be capable of quantitatively explaining the conjunction fallacy in the same…

Biological Physics · Physics 2012-09-21 Taksu Cheon , Taiki Takahashi

The paper contains an alternative proof of M. Kontsevich Formality Theorem.

Quantum Algebra · Mathematics 2007-05-23 Dmitry E. Tamarkin

We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…

Logic in Computer Science · Computer Science 2025-07-10 Sara Ayhan , Hrafn Valtýr Oddsson

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

General Mathematics · Mathematics 2021-10-14 Dagnachew Jenber

We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.

Combinatorics · Mathematics 2017-09-22 Moa Apagodu

Well-known principles of induction include monotone induction and different sorts of non-monotone induction such as inflationary induction, induction over well-founded sets and iterated induction. In this work, we define a logic formalizing…

Artificial Intelligence · Computer Science 2007-05-23 Marc Denecker , Eugenia Ternovska

Argumentation is the process of constructing arguments about propositions, and the assignment of statements of confidence to those propositions based on the nature and relative strength of their supporting arguments. The process is modelled…

Artificial Intelligence · Computer Science 2013-03-08 John Fox , Paul J. Krause , Morten Elvang-Gøransson