Programs and logics (Q1070221): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5181349 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4130967 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Untersuchungen über das logische Schliessen. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proving algorithms by tail functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3881900 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4109270 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5734410 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequents in many valued logic I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5596237 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A formalization of the modal propositional S4 calculus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sequence formalization for SCI / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Gentzen Type Formalizations / rank | |||
Normal rank |
Latest revision as of 10:36, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Programs and logics |
scientific article |
Statements
Programs and logics (English)
0 references
1985
0 references
The paper is concerned with a relationship between programs and Gentzen type formalizations of predicate and propositional logics. It turns out that finite control algorithms (which serve as models of iterative programs) are sufficient for describing the proof searching procedures for propositional logics which admit cut-free Gentzen type formalization, whereas push-down algorithms (which are adequate models for programs with recursive procedures) are needed to describe those procedures for predicate calculi.
0 references
predicate logic
0 references
recursive programs
0 references
Gentzen type formalizations
0 references
finite control algorithms
0 references
iterative programs
0 references
proof searching procedures
0 references
propositional logics
0 references
push-down algorithms
0 references