English
Related papers

Related papers: Note on paraconsistency and reasoning about fracti…

200 papers

A paraconsistent type theory (an extension of a fragment of intuitionistic type theory by adding opposite types) is here extended by adding co-function types. It is shown that, in the extended paraconsistent type system, the opposite type…

Logic in Computer Science · Computer Science 2022-04-11 Juan C. Agudelo-Agudelo , Andrés Sicard-Ramírez

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

Dynamical Systems · Mathematics 2024-12-09 Niels Langeveld , David Ralston

In this article, the hierarchy of LFIs L$_n^k$, Logics of Controlled Consistency (LCC), is introduced. Inspired by da Costa's original C$_n$ systems, this hierarchy can represent different degrees of paraconsistent commitment and different…

Logic in Computer Science · Computer Science 2026-04-22 Marcelo E. Coniglio , Rafael Ongaratto

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…

Logic in Computer Science · Computer Science 2013-02-05 Giorgi Japaridze

Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which…

Artificial Intelligence · Computer Science 2007-05-23 Kewen Wang , Lizhu Zhou

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

Logic · Mathematics 2022-07-18 Reijo Jaakkola , Antti Kuusisto

We augment LP with a strong conditional operator, to yield a logic we call "strong LP," or LP=>. The resulting logic can speak of consistency in more discriminating ways, but introduces new possibilities for trivializing paradoxes.

Logic · Mathematics 2013-04-25 Nick Thomas

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…

Logic in Computer Science · Computer Science 2012-04-16 Mnacho Echenim , Nicolas Peltier

Ap\'ery's remarkable discovery of rapidly converging continued fractions with small coefficients for $\zeta(2)$ and $\zeta(3)$ has led to a flurry of important activity in an incredible variety of different directions. Our purpose is to…

Number Theory · Mathematics 2025-11-04 Henri Cohen , Wadim Zudilin

Corrections are brought to an article of Friesen on continued fractions of a given period.

Number Theory · Mathematics 2014-04-02 Vladimir Pletser

We propose an integration of possibility theory into non-classical logics. We obtain many formal results that generalize the case where possibility and necessity functions are based on classical logic. We show how useful such an approach is…

Artificial Intelligence · Computer Science 2013-02-28 Philippe Besnard , Jerome Lang

We prove singularity of some distributions of random continued fractions that correspond to iterated function systems with overlap and a parabolic point. These arose while studying the conductance of Galton-Watson trees.

Probability · Mathematics 2007-05-23 Russell Lyons

In this short note, we are concerned with the fairness condition "A and B hold almost equally often", which is important for specifying and verifying the correctness of non-terminating processes and protocols. We introduce the logic of…

Logic in Computer Science · Computer Science 2023-06-05 Thomas Studer

The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas. Surprisingly, this logic is constructive and so…

Logic · Mathematics 2018-10-19 Federico Aschieri

Defeasible statements are statements that are likely, or probable, or usually true, but may occasionally be false. Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers.…

Artificial Intelligence · Computer Science 2026-04-22 David Billington

In this note, we will give a short proof of an identity for cubic partitions.

Number Theory · Mathematics 2015-03-17 Xinhua Xiong

This essay considers the special character of mathematical reasoning, and draws on observations from interactive theorem proving and the history of mathematics to clarify the nature of formal and informal mathematical language. It proposes…

History and Overview · Mathematics 2015-08-24 Jeremy Avigad

The converse of Fortin's Lemma in Banach spaces is established in this Note.

Numerical Analysis · Mathematics 2016-02-16 Alexandre Ern , Jean-Luc Guermond

In this paper an approach to automated deduction under uncertainty,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a lower bound of a necessity or a possibility measure,…

Artificial Intelligence · Computer Science 2013-04-08 Didier Dubois , Jerome Lang , Henri Prade

A new simple proof of Stirling's formula via the partial fraction expansion for the tangent function is presented.

History and Overview · Mathematics 2014-07-15 Thorsten Neuschel
‹ Prev 1 4 5 6 7 8 10 Next ›