Three ways of recognizing inessential formulas in sequents (Q1167722): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01629445 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2323486780 / rank | |||
Normal rank | |||
Latest revision as of 08:28, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three ways of recognizing inessential formulas in sequents |
scientific article |
Statements
Three ways of recognizing inessential formulas in sequents (English)
0 references
1982
0 references
derivability
0 references
hereditary unsolvability
0 references
intuitionistic equality theory
0 references
intuitionistic monadic predicate calculus
0 references
unessential formulas in classical and intuitionistic predicate calculus
0 references
