Cover Image

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anttila, Aleksi, Kontinen, Juha, Yang, Fan
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Logic 03D15, 03B60 F.2.2; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Primer for Preferential Non-Monotonic Propositional Team Logics
by: Sauerwald, Kai, et al.
Published: (2024)

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

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

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

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)

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

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

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

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)

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)

A Deep-Inference Sequent Calculus for Basic Propositional Team Logic (Without Delving Too Deep)
by: Anttila, Aleksi, et al.
Published: (2025)

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

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

Reasoning Around Paradox with Grounded Deduction
by: Ford, Bryan
Published: (2024)

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

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

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

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

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

The Golden Path to Guarded Monotone Strict NP
by: Barsukov, Alexey, et al.
Published: (2023)

Belief in Simplicial Complexes
by: Sink, Philip, et al.
Published: (2025)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

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

Sheaves as oracle computations
by: Ahman, Danel, et al.
Published: (2026)

Agent Interpolation for Knowledge
by: Bílková, Marta, et al.
Published: (2025)

Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
by: Galliani, Pietro
Published: (2025)

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

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

The reverse mathematics of the pigeonhole hierarchy
by: Houérou, Quentin Le, et al.
Published: (2024)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

Modal logic, fundamentally
by: Holliday, Wesley H.
Published: (2024)

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

Towards Weak Stratification for Logics of Definitions
by: Guermond, Nathan
Published: (2026)

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

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
by: Vodrazka, Daniel
Published: (2025)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

A declarative approach to specifying distributed algorithms using three-valued modal logic
by: Gabbay, Murdoch J., et al.
Published: (2025)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)