Cover Image

Evaluation trees for proposition algebra

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bergstra, Jan A., Ponse, Alban
Format:	Preprint
Published:	2015
Subjects:	Logic in Computer Science 03B05, 03B70 F.3.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fracterm Calculus for Partial Meadows
by: Bergstra, Jan A., et al.
Published: (2025)

Conditional logic as a short-circuit logic
by: Bergstra, Jan A., et al.
Published: (2023)

Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant
by: Bergstra, Jan A., et al.
Published: (2018)

A propositional cirquent calculus for computability logic
by: Japaridze, Giorgi
Published: (2024)

Fully Evaluated Left-Sequential Logics
by: Ponse, Alban, et al.
Published: (2024)

A domain-theoretic framework for conditional probability and Bayesian updating in programming
by: Di Gianantonio, Pietro, et al.
Published: (2025)

Extracting total Amb programs from proofs
by: Berger, Ulrich, et al.
Published: (2023)

Continuous and algebraic domains in univalent foundations
by: de Jong, Tom, et al.
Published: (2024)

Nested Sequents for Intuitionistic Multi-Modal Logics: Modularity, Cut-Elimination, and Undecidability
by: Lyon, Tim S.
Published: (2025)

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
by: Ramos, Arthur, et al.
Published: (2025)

Node Replication: Theory And Practice
by: Kesner, Delia, et al.
Published: (2022)

Internal Effectful Forcing in System T
by: Escardo, Martin H., et al.
Published: (2025)

The logic of bunched implications is undecidable
by: Galatos, Nick, et al.
Published: (2026)

A Sequent Calculus Perspective on Base-Extension Semantics (Technical Report)
by: Barroso-Nascimento, Victor, et al.
Published: (2025)

Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
by: Japaridze, Giorgi
Published: (2026)

Thoughts on sub-Turing interactive computability
by: Japaridze, Giorgi
Published: (2024)

Examples and counterexamples of injective types
by: de Jong, Tom, et al.
Published: (2026)

Discrete dualities for some algebras from rough sets
by: Düntsch, Ivo, et al.
Published: (2026)

Meaning as Use, Application, Employment, Purpose, Usefulness
by: de Queiroz, Ruy J. G. B.
Published: (2025)

From the Notebooks to the Investigations and Beyond
by: de Queiroz, Ruy J. G. B.
Published: (2025)

Normalization properties of $λμ$-calculus using realizability semantics
by: Battyanyi, Peter, et al.
Published: (2023)

ProofCloud: A Proof Retrieval Engine for Verified Proofs in Higher Order Logic
by: Wang, Shuai
Published: (2024)

Labeled Sequent Calculus and Countermodel Construction for Justification Logics
by: Ghari, Meghdad
Published: (2014)

Encoding argumentation frameworks with set attackers to propositional logic systems
by: Tang, Shuai, et al.
Published: (2025)

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
by: Barroso-Nascimento, Victor, et al.
Published: (2025)

Encoding higher-order argumentation frameworks with supports to propositional logic systems
by: Tang, Shuai
Published: (2025)

Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory
by: Gylterud, Håkon Robbestad, et al.
Published: (2020)

Inclusion with repetitions and Boolean constants -- implication problems revisited
by: Häggblom, Matilda
Published: (2025)

Axiomatization of approximate exclusion
by: Häggblom, Matilda
Published: (2024)

Axiomatizing approximate inclusion
by: Häggblom, Matilda
Published: (2025)

On the Relative Completeness of Satisfaction-based Quantum Hoare Logic
by: Sun, Xin, et al.
Published: (2024)

On the Relative Completeness of Satisfaction-based Probabilistic Hoare Logic With While Loop
by: Sun, Xin, et al.
Published: (2024)

A Coherence Construction for the Propositional Universe
by: Huang, Xu
Published: (2024)

A proof-theoretical approach to some extensions of first order quantification
by: Allègre, Loïc, et al.
Published: (2024)

Coalgebraic Satisfiability Checking for Arithmetic $μ$-Calculi
by: Hausmann, Daniel, et al.
Published: (2022)

Getting Wiser from Multiple Data: Probabilistic Updating according to Jeffrey and Pearl
by: Jacobs, Bart
Published: (2024)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
by: Lopez, Aliaume
Published: (2024)

On the Complexity and Properties of Preferential Propositional Dependence Logic
by: Sauerwald, Kai, et al.
Published: (2025)

Representation Theorems for Cumulative Propositional Dependence Logics
by: Kontinen, Juha, et al.
Published: (2026)

On the Complexity of Entailment for Cumulative Propositional Dependence Logics
by: Sauerwald, Kai, et al.
Published: (2026)