arXiv (All)
open access
Finite Spectra of Syllogistic Logic with Cardinality Comparisons
We study the finite spectra of the syllogistic logic with cardinality comparisons $S^\dagger(card)$. Since the language does not contain conjunction at the sentence level, we consider the spectrum of a theory $Γ$, namely the set of positive integers $n$ for which $Γ$ is satisfiable in an $n$-element
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- ""Lambda theory: Introduction of a constant for" nothing" into set theory, a model of consistency and most noticeable conclusions#721291
- Logicism, Interpretability, and Knowledge of Arithmetic#776229
- Compact propositional Gödel logics#697286
- A Catalogue of Properties of Binary Relations: Entailments, Incompatibilities, and Independence Results#1071119
- Labeled calculi and finite-valued logics#697297
Record · ID 1051299
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive