Imagen de Portada

Logics for the Relational Syllogistic

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pratt-Hartmann, Ian, Moss, Lawrence S.
Formato:	Preprint
Publicado:	2008
Materias:	Logic in Computer Science Computational Complexity Computation and Language F.4.1; I.2.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Hamiltonian Syllogistic
por: Pratt-Hartmann, Ian
Publicado: (2010)

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

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

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

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

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

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

Incomplete Descriptions and Qualified Definiteness
por: Więckowski, Bartosz
Publicado: (2024)

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

Metric Equational Theories
por: Mardare, Radu, et al.
Publicado: (2025)

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

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

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

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

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

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

Discernment is all you need
por: Fuenmayor, David
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Robust Computation Tree Logic
por: Nayak, Satya Prakash, et al.
Publicado: (2022)

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

Modal Logics -- RNmatrices vs. Nmatrices
por: Coniglio, Marcelo E., et al.
Publicado: (2024)