Realizability in cyclic proof: extracting ordering information for infinite descent (Q1694474)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6833563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Realizability in cyclic proof: extracting ordering information for infinite descent |
scientific article; zbMATH DE number 6833563 |
Statements
Realizability in cyclic proof: extracting ordering information for infinite descent (English)
0 references
2 February 2018
0 references
approximation semantics
0 references
cyclic proof
0 references
entailment
0 references
inductive predicates
0 references
infinite descent
0 references
realizability
0 references
sequent calculus
0 references
weighted automata
0 references
0.7299597859382629
0 references
0.7072170376777649
0 references
0.7043946981430054
0 references
0.6985293030738831
0 references
0.6907327175140381
0 references
