Cover Image

Three Fixed-Dimension Satisfiability Semantics for Quantum Logic: Implications and an Explicit Separator

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Higuchi, Joaquim Reizi
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science Computational Complexity Logic 03G12, 06C15, 81P10 F.4.1; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
by: Kazakov, Yevgeny, et al.
Published: (2009)

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

Proving Unsatisfiability with Hitting Formulas
by: Filmus, Yuval, et al.
Published: (2023)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)

The first fatal axiom for weakened sequential products on finite MV-effect algebras: Local obstruction, exact low-rank classification, and the rank-one boundary case
by: Higuchi, Joaquim Reizi
Published: (2026)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

Categorical Equivalence Between Finitary Orthomodular Dynamic Algebras and Orthomodular Lattices
by: Putra, Juanda Kelana, et al.
Published: (2026)

Team Semantics and Independence Notions in Quantum Physics
by: Abramsky, Samson, et al.
Published: (2021)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
by: Grotenhuis, Lide, et al.
Published: (2026)

Complexity Classification Transfer for CSPs via Algebraic Products
by: Bodirsky, Manuel, et al.
Published: (2022)

Axiomatizing the Logic of Ordinary Discourse
by: Greati, Vitor, et al.
Published: (2024)

On $\mathscr{T}$-based orthomodular dynamic algebras
by: Paseka, Jan, et al.
Published: (2026)

A Theory for Probabilistic Polynomial-Time Reasoning
by: Chen, Lijie, et al.
Published: (2026)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

The Fluted Fragment with Transitive Relations
by: Pratt-Hartmann, Ian, et al.
Published: (2020)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

The Directed Van Kampen Theorem in Lean
by: Basold, Henning, et al.
Published: (2023)

What If Turing Had Preceded Gödel?
by: Oberhoff, Sebastian
Published: (2024)

Finite Hilbert systems for Weak Kleene logics
by: Greati, Vitor, et al.
Published: (2024)

Polynomial-time Tractable Problems over the $p$-adic Numbers
by: Fehm, Arno, et al.
Published: (2025)

Glivenko's theorems from an ecumenical perspective
by: Pereira, Luiz Carlos, et al.
Published: (2026)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups
by: Grochow, Joshua A., et al.
Published: (2022)

Notes on CSPs and Polymorphisms
by: Brady, Zarathustra
Published: (2022)

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

Proof Compression via Subatomic Logic and Guarded Substitutions
by: Barrett, Victoria, et al.
Published: (2025)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
by: Bodirsky, Manuel, et al.
Published: (2024)

Hereditary First-Order Logic: the tractable quantifier prefix classes
by: Bodirsky, Manuel, et al.
Published: (2024)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

When do homomorphism counts help in query algorithms?
by: Cate, Balder ten, et al.
Published: (2023)

Discernment is all you need
by: Fuenmayor, David
Published: (2026)

Structure-Guided Automated Reasoning
by: Bannach, Max, et al.
Published: (2023)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

Cut elimination for propositional cyclic proof systems with fixed-point operators
by: Hori, Hiromasa, et al.
Published: (2023)

Possibility Semantics
by: Holliday, Wesley H.
Published: (2024)

Conjunctive categorial grammars and Lambek grammars with additives
by: Kuznetsov, Stepan L., et al.
Published: (2024)

A Resolution-Based Interactive Proof System for UNSAT
by: Czerner, Philipp, et al.
Published: (2024)

Modal Logic with Relations over Paths: a Theoretical Development through Comonadic Semantics
by: Figueira, Santiago, et al.
Published: (2023)