Cover Image

A Topological Rewriting of Tarski's Mereogeometry

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barlatier, Patrick, Dapoigny, Richard
Format:	Preprint
Published:	2025
Subjects:	Logic Logic in Computer Science F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Left-Linear Rewriting in Adhesive Categories
by: Baldan, Paolo, et al.
Published: (2024)

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
by: Becker, Justus
Published: (2025)

Satisfiability in Łukasiewicz logic and its unbounded relative
by: Haniková, Zuzana, et al.
Published: (2025)

Logic of Sets with Atoms
by: Masters, Jake
Published: (2025)

Semi-Substructural Logics à la Lambek
by: Wan, Cheng-Syuan
Published: (2024)

Extensions of K5: Proof Theory and Uniform Lyndon Interpolation
by: van der Giessen, Iris, et al.
Published: (2023)

Cardinality and Representation of Stone Relation Algebras
by: Furusawa, Hitoshi, et al.
Published: (2023)

A Construction of the Lie Algebra of a Lie Group in Isabelle/HOL
by: Schmoetten, Richard, et al.
Published: (2024)

Two-Level Type Theory and Applications
by: Annenkov, Danil, et al.
Published: (2017)

New Bounds for the Ideal Proof System in Positive Characteristic
by: Behera, Amik Raj, et al.
Published: (2025)

Semantics out of context: nominal absolute denotations for first-order logic and computation
by: Gabbay, Murdoch J.
Published: (2013)

Coinductive proof search for polarized logic with applications to full intuitionistic propositional logic
by: Santo, José Espírito, et al.
Published: (2020)

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

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

Locality in Residuated-Lattice Structures
by: Carr, James
Published: (2025)

Degree-preserving Godel logics with an involution: intermediate logics and (ideal) paraconsistency
by: Coniglio, M. E., et al.
Published: (2026)

A Proof of the Schröder-Bernstein Theorem in ACL2
by: Jurgensen, Grant
Published: (2025)

A Curiously Effective Backtracking Strategy for Connection Tableaux
by: Färber, Michael
Published: (2021)

A Mimamsa Inspired Framework For Instruction Sequencing In AI Agents
by: Srinivasan, Bama
Published: (2025)

A Unified Gentzen-style Framework for Until-free LTL
by: Kamide, Norihiro, et al.
Published: (2024)

A topological counterpart of well-founded trees in dependent type theory
by: Maietti, Maria Emilia, et al.
Published: (2023)

A parametricity-based formalization of semi-simplicial and semi-cubical sets
by: Herbelin, Hugo, et al.
Published: (2023)

CoLF Logic Programming as Infinitary Proof Exploration
by: Chen, Zhibo, et al.
Published: (2025)

Dependently Sorted Nominal Signatures
by: Fernández, Maribel, et al.
Published: (2025)

The mu-calculus' Alternation Hierarchy is Strict over Non-Trivial Fusion Logics
by: Pacheco, Leonardo
Published: (2025)

Who Wins the Multi-Structural Game?
by: Fagin, Ronald, et al.
Published: (2025)

The Limit of Recursion in State-based Systems
by: Afshari, Bahareh, et al.
Published: (2025)

Scroll nets
by: Donato, Pablo
Published: (2025)

Type Theory with Single Substitutions
by: Kaposi, Ambrus, et al.
Published: (2025)

The Dependently Typed Higher-Order Form for the TPTP World
by: Ranalter, Daniel, et al.
Published: (2025)

Characterization of Lattice Properties Within Modal Extensions
by: Freire, Alfredo R., et al.
Published: (2025)

Complexity of Łukasiewicz Modal Probabilistic Logics
by: Kozhemiachenko, Daniil, et al.
Published: (2025)

The Cost of Skeletal Call-by-Need, Smoothly
by: Accattoli, Beniamino, et al.
Published: (2025)

Expressivity of bisimulation pseudometrics over analytic state spaces
by: Luckhardt, Daniel, et al.
Published: (2025)

Transporting Theorems about Typeability in LF Across Schematically Defined Contexts
by: Johnson, Chase, et al.
Published: (2025)

On a Dependently Typed Encoding of Matching Logic
by: Kurucz, Ádám, et al.
Published: (2025)

On the Formal Metatheory of the Pure Type Systems using One-sorted Variable Names and Multiple Substitutions
by: Urciuoli, Sebastián
Published: (2025)

Satisfiability for Knowing How over Linear Plans is NP-complete
by: Areces, Carlos, et al.
Published: (2026)

Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar
by: Binder, Sage, et al.
Published: (2026)