RECORD
Definable families of theories, related calculi and ranks
Logic · Submitted 30 Jan 2019
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We consider sentence-definable and diagram-definable subfamilies of given families of theories, calculi for these subfamilies, as well dynamics and characteristics of these subfamilies with respect to rank and degree.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We consider sentence-definable and diagram-definable subfamilies of given families of theories, calculi for these subfamilies, as well dynamics and characteristics of these subfamilies with respect to rank and degree.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We consider sentence-definable and diagram-definable subfamilies of given families of theories, calculi for these subfamilies, as well dynamics and characteristics of these subfamilies with respect to rank and degree. | contribution 0.99 | 0.75 | 0.17 | asserted 0.55 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We consider sentence-definable and diagram-definable subfamilies of given families of theories, calculi for these subfamilies, as well dynamics and characteristics of these subfamilies with respect to rank and degree.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites · 12 sentences without a confident label
Cites as background 3 papers
-
Throughout the paper we consider complete first-order theories $T$ in predicate languages $Σ(T)$ and use the following terminology in [ref] .
Ranks for families of theories and their spectra · Preliminaries · 0.95
-
Throughout the paper we consider complete first-order theories $T$ in predicate languages $Σ(T)$ and use the following terminology in [ref] .
Approximations of theories · Preliminaries · 0.95
-
All possible values of the ranks and degrees for families of all theories in given languages were described in [ref] .
Ranks for families of all theories of given languages · Introduction · 0.90
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.