English
Related papers

Related papers: Note on paraconsistency and reasoning about fracti…

200 papers

In this paper, we present the interval neutrosophic logics which generalizes the fuzzy logic, paraconsistent logic, intuitionistic fuzzy logic and many other non-classical and non-standard logics. We will give the formal definition of…

Logic in Computer Science · Computer Science 2007-05-23 Haibin Wang , Florentin Smarandache , Yanqing Zhang , Rajshekhar Sunderraman

Possibilistic logic is a well-known graded logic of uncertainty suitable to reason under incomplete information and partially inconsistent knowledge, which is built upon classical first order logic. There exists for Possibilistic logic a…

Artificial Intelligence · Computer Science 2013-01-31 Teresa Alsinet , Lluis Godo , Sandra Sandri

A well-known principle states that a congruence between objects should give rise to a corresponding congruence between the special values of $L$-functions attached to these objects. We computationally investigate this principle for…

Number Theory · Mathematics 2026-03-12 P. Narayanan , A. Raghuram

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

Number Theory · Mathematics 2025-02-28 Henri Cohen

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

Number Theory · Mathematics 2017-04-13 Verónica Becher , Sergio A. Yuhjtman

Using Singular Rescaling We Prove Some Bifurcation Results. This note Presents short proofs for some Bifurcation results which had been appeared with other authors.

Dynamical Systems · Mathematics 2024-04-16 Ali Taghavi

In this note, we give a linear-size translation from formulas of first-order logic into equations of the calculus of relations preserving validity and finite validity. Our translation also gives a linear-size conservative reduction from…

Logic in Computer Science · Computer Science 2025-12-31 Yoshiki Nakamura

The connection between continued fractions and orthogonality which is familiar for $J$-fractions and $T$-fractions is extended to what we call $R$-fractions of type I and II. These continued fractions are associated with recurrence…

Classical Analysis and ODEs · Mathematics 2008-02-03 Mourad E. H. Ismail , David R. Masson

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

Logic · Mathematics 2023-10-03 Sohei Iwata , Taishi Kurahashi , Yuya Okawa

There is knowledge. There is belief. And there is tacit agreement.' 'We may talk about objects. We may talk about attributes of the objects. Or we may talk both about objects and their attributes.' This work inspects tacit agreements on…

Artificial Intelligence · Computer Science 2014-04-25 Ryuta Arisaka

The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…

Logic in Computer Science · Computer Science 2024-05-30 Michael J. Maher

We introduce a logic for knowledge representation and reasoning on protein-protein interactions. Modulo a theory, formulas describe protein structures and dynamic changes. They can be composed in order to add or remove static and dynamic…

Logic in Computer Science · Computer Science 2019-09-19 Adrien Husson , Jean Krivine

In this preliminary note, we will illustrate our ideas on automated mechanisms for termination and non-termination reasoning.

Programming Languages · Computer Science 2013-09-13 Ton Chanh Le

Program logics typically reason about an over-approximation of program behaviour to prove the absence of bugs. Recently, program logics have been proposed that instead prove the presence of bugs by means of under-approximate reasoning,…

Logic in Computer Science · Computer Science 2022-03-15 Christopher M. Poskitt

Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. A purely numeric mechanism, like those proposed so far, cannot provide a…

Artificial Intelligence · Computer Science 2013-04-15 Alan Bundy

This paper is a brief and informal presentation of cirquent calculus, a novel proof system for resource-conscious logics. As such, it is a refinement of sequent calculus with mechanisms that allow to explicitly account for the possibility…

Logic in Computer Science · Computer Science 2021-08-31 Giorgi Japaridze , Bikal Lamichhane

A consistently specified halting function may be computed.

Logic in Computer Science · Computer Science 2016-06-29 Eric C. R. Hehner

We prove a continued fraction expansion for the reciprocal of a certain $q$-series. All the specialists in the world are asked whether it is new or not.

Combinatorics · Mathematics 2008-06-06 Helmut Prodinger

Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any…

Logic in Computer Science · Computer Science 2013-12-18 James Cheney

Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal…

Number Theory · Mathematics 2026-04-24 Jungwon Lee
‹ Prev 1 8 9 10 Next ›