A normalization-procedure for the first order classical natural deduction with full logical symbols (Q1904467): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Branislav R. Boričić / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Branislav R. Boričić / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.21099/tkbjm/1496162804 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1584940602 / rank
 
Normal rank

Latest revision as of 03:46, 20 March 2024

scientific article
Language Label Description Also known as
English
A normalization-procedure for the first order classical natural deduction with full logical symbols
scientific article

    Statements

    A normalization-procedure for the first order classical natural deduction with full logical symbols (English)
    0 references
    0 references
    22 April 1996
    0 references
    The author describes a normalization procedure for a natural deduction formulation of classical first-order logic [see \textit{D. Prawitz}: Natural deduction -- A proof theoretical study (1965; Zbl 0173.00205), and Proc. Second Scandinav. Logic Symp. 1970, Stud. Logic Found. Math. 63, 235-307 (1971; Zbl 0226.02031); \textit{B. R. Boričić}, J. Philos. Logic 14, 359-377 (1985; Zbl 0572.03033); \textit{J. P. Seldin}, Stud. Logica 48, 193- 217 (1989; Zbl 0692.03007); \textit{G. Stålmarck}, J. Symb. Logic 56, 129-149 (1991; Zbl 0735.03028)]. The reduction procedure presented here can be considered as a natural extension of Prawitz's reduction procedure, but on the full set of logical symbols.
    0 references
    0 references
    normalization procedure
    0 references
    natural deduction
    0 references
    classical first-order logic
    0 references
    reduction
    0 references
    0 references