English
Related papers

Related papers: Q-tableaux for Implicational Propositional Calculu…

200 papers

Part I. Some Facts From p-Adic Analysis. Part II. Tables of Integrals.

Mathematical Physics · Physics 2007-05-23 V. S. Vladimirov

In this paper, we investigate some properties of q-Bernoulli polynomi- als arising from q-umbral calculus. Finally, we derive some interesting identities of q-Bernoulli polynomials from our investigation.

Number Theory · Mathematics 2013-07-01 Dae san Kim , Taekyun Kim

A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…

Classical Analysis and ODEs · Mathematics 2018-01-29 P. Njionou Sadjang

A major reason behind the success of probability calculus is that it possesses a number of valuable tools, which are based on the notion of probabilistic independence. In this paper, I identify a notion of logical independence that makes…

Artificial Intelligence · Computer Science 2013-03-08 Adnan Darwiche

Relations between differential calculi, quantum groups, integrable systems, and q-analysis are studied. Some new Hirota type formulas are established for qKP along with variations on classical Hirota formulas.

Quantum Algebra · Mathematics 2007-05-23 Robert Carroll

We show that Propositional Dynamic Logic (PDL) has the Craig Interpolation Property. This question has been open for many years. Three proof attempts were published, but later criticized in the literature or retracted. Our proof is based on…

Logic in Computer Science · Computer Science 2025-03-18 Manfred Borzechowski , Malvin Gattinger , Helle Hvid Hansen , Revantha Ramanayake , Valentina Trucco Dalmas , Yde Venema

Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type…

Logic in Computer Science · Computer Science 2010-04-29 César Domínguez , Julio Rubio

In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…

Logic · Mathematics 2009-05-05 Karim Nour , Khelifa Saber

We study a many-valued generalization of Propositional Dynamic Logic where formulas in states and accessibility relations between states of a Kripke model are evaluated in a finite FL-algebra. One natural interpretation of this framework is…

Logic in Computer Science · Computer Science 2020-12-23 Igor Sedlár

We prove a multiplication theorem for quantum cluster algebras of acyclic quivers. The theorem generalizes the multiplication formula for quantum cluster variables in \cite{fanqin}. We apply the formula to construct some $\mathbb{ZP}$-bases…

Representation Theory · Mathematics 2010-11-09 Ming Ding , Fan Xu

In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a relation between this system and linear logic.

Logic · Mathematics 2009-05-12 Karim Nour , Olivier Laurent

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Logic · Mathematics 2023-03-21 Davide Emilio Quadrellaro

We present an incomplete proof synthesis method for the Calculus of Constructions which is always terminating and a complete Vernacular for the Calculus of Constructions based on this method.

Logic in Computer Science · Computer Science 2023-10-09 Gilles Dowek

We use an elementary argument to prove some finite sums involving expressions of the forms $(q)_n$ and $(a;q)_n$ along with inductive formulas for some sequences.

Number Theory · Mathematics 2016-09-23 Mohamed El Bachraoui

We consider team semantics for propositional logic, continuing our previous work (Yang & V\"a\"an\"anen 2016). In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an…

Logic · Mathematics 2018-12-19 Fan Yang , Jouko Väänänen

To appear in Theory and Practice of Logic Programming (TPLP). Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling…

Programming Languages · Computer Science 2020-02-19 Thepfrastos Mantadelis , Ricardo Rocha , Paulo Moura

We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.

Logic in Computer Science · Computer Science 2013-04-01 Alejandro Díaz-Caro , Gilles Dowek

In order to avoid well-know paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type$_0$ : Type$_1$ :…

Programming Languages · Computer Science 2020-03-12 Amin Timany , Matthieu Sozeau

Starting from involutive BE algebras, we redefine the orthomodular algebras, by introducing the notion of implicative-orthomodular algebras. We investigate properties of implicative-orthomodular algebras, and give characterizations of these…

Logic · Mathematics 2024-01-09 Lavinia Corina Ciungu

The complexes of integral forms on the quantum Euclidean group $E_q(2)$ and the quantum plane are defined and their isomorphisms with the corresponding de Rham complexes are established.

Quantum Algebra · Mathematics 2015-03-13 Tomasz Brzeziński