:: Library Catalog

Omslagsbillede

Saved in:

Bibliografiske detaljer
Main Authors:	Pratt-Hartmann, Ian, Moss, Lawrence S.
Format:	Preprint
Udgivet:	2008
Fag:	Logic in Computer Science Computational Complexity Computation and Language F.4.1; I.2.3
Online adgang:	https://arxiv.org/abs/0808.0521
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!

Lignende værker

The Hamiltonian Syllogistic
af: Pratt-Hartmann, Ian
Udgivet: (2010)

On the Complexity of the Numerically Definite Syllogistic and Related Fragments
af: Pratt-Hartmann, Ian
Udgivet: (2007)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
af: de Rezende, Susanna F., et al.
Udgivet: (2019)

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

Bidirectional Interpolation for the Lambda-Calculus -- Revisiting and Formalising Craig-Čubrić Interpolation
af: Bertrand, Meven Lennon, et al.
Udgivet: (2026)

Solving Quantified Modal Logic Problems by Translation to Classical Logics
af: Steen, Alexander, et al.
Udgivet: (2022)

Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
af: Pratt-Hartmann, Ian
Udgivet: (2008)

Mechanized HOL Reasoning in Set Theory
af: Guilloud, Simon, et al.
Udgivet: (2024)

Incomplete Descriptions and Qualified Definiteness
af: Więckowski, Bartosz
Udgivet: (2024)

Term Orders for Optimistic Lambda-Superposition
af: Bentkamp, Alexander, et al.
Udgivet: (2025)

Metric Equational Theories
af: Mardare, Radu, et al.
Udgivet: (2025)

Canonical for Automated Theorem Proving in Lean
af: Norman, Chase, et al.
Udgivet: (2025)

Implementing Dependent Type Theory Inhabitation and Unification
af: Norman, Chase, et al.
Udgivet: (2026)

Experiments with Choice in Dependently-Typed Higher-Order Logic
af: Ranalter, Daniel, et al.
Udgivet: (2024)

A Coq-based Axiomatization of Tarski's Mereogeometry
af: Barlatier, Patrick, et al.
Udgivet: (2025)

Tractable and Intractable Entailment Problems in Separation Logic with Inductively Defined Predicates
af: Echenim, Mnacho, et al.
Udgivet: (2023)

Discernment is all you need
af: Fuenmayor, David
Udgivet: (2026)

A Sequent Calculus for General Inductive Definitions
af: Eede, Robbe Van den, et al.
Udgivet: (2026)

A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
af: Klaus, Natalia, et al.
Udgivet: (2026)

SPARQL in N3: SPARQL CONSTRUCT as a rule language for the Semantic Web (Extended Version)
af: Arndt, Dörthe, et al.
Udgivet: (2025)

Implementing the First-Order Logic of Here and There
af: Otten, Jens, et al.
Udgivet: (2026)

OnlineProver: Experience with a Visualisation Tool for Teaching Formal Proofs
af: Perháč, Ján, et al.
Udgivet: (2025)

TPTP World Infrastructure for Non-classical Logics
af: Steen, Alexander, et al.
Udgivet: (2025)

Understanding Syllogistic Reasoning in LLMs from Formal and Natural Language Perspectives
af: Poddar, Aheli, et al.
Udgivet: (2025)

Evaluating Autoformalization Robustness via Semantically Similar Paraphrasing
af: Moore, Hayden, et al.
Udgivet: (2025)

Logic.py: Bridging the Gap between LLMs and Constraint Solvers
af: Kesseli, Pascal, et al.
Udgivet: (2025)

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

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

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
af: Conneryd, Jonas, et al.
Udgivet: (2025)

On bounded depth proofs for Tseitin formulas on the grid; revisited
af: Håstad, Johan, et al.
Udgivet: (2022)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
af: de Rezende, Susanna F., et al.
Udgivet: (2026)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
af: de Rezende, Susanna F., et al.
Udgivet: (2024)

Supercritical Tradeoffs for Monotone Circuits
af: Göös, Mika, et al.
Udgivet: (2024)

Pantograph: A Machine-to-Machine Interaction Interface for Advanced Theorem Proving, High Level Reasoning, and Data Extraction in Lean 4
af: Aniva, Leni, et al.
Udgivet: (2024)

Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
af: Ito, Sohei, et al.
Udgivet: (2026)

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

Which are the True Defeasible Logics?
af: Maher, Michael J.
Udgivet: (2024)

Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
af: Pratt-Hartmann, Ian
Udgivet: (2004)

Efficient Solving of Quantified Inequality Constraints over the Real Numbers
af: Ratschan, Stefan
Udgivet: (2002)

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