W. P. de RoeverJr., Recursive program schemes: semantics and proof theory. Mathematical Centre tracts, no. 70. Mathematisch Centrum, Amsterdam1976, ix + 112 pp.

1979 ◽  
Vol 44 (4) ◽  
pp. 658-659
Author(s):  
Peter Lauer
Keyword(s):  
Proof Theory ◽  
Recursive Program

Structural Proof Theory

2001 ◽  
Author(s):  
Sara Negri ◽  
Jan von Plato ◽  
Aarne Ranta
Keyword(s):  
Proof Theory ◽  
Structural Proof Theory

Basic Proof Theory

2000 ◽  
Author(s):  
A. S. Troelstra ◽  
H. Schwichtenberg
Keyword(s):  
Proof Theory

Proof Theory of the Cut Rule

2018 ◽  
Author(s):  
J. R. B. Cockett ◽  
R. A. G. Seely
Keyword(s):  
Proof Theory ◽  
Graphical Representation ◽  
Basic Component ◽  
Graphical Representations ◽  
Mathematical Language ◽  
Basic Logic ◽  
Cut Rule ◽  
Structural Rules ◽  
The One ◽  
Categorical Semantics

This chapter describes the categorical proof theory of the cut rule, a very basic component of any sequent-style presentation of a logic, assuming a minimum of structural rules and connectives, in fact, starting with none. It is shown how logical features can be added to this basic logic in a modular fashion, at each stage showing the appropriate corresponding categorical semantics of the proof theory, starting with multicategories, and moving to linearly distributive categories and *-autonomous categories. A key tool is the use of graphical representations of proofs (“proof circuits”) to represent formal derivations in these logics. This is a powerful symbolism, which on the one hand is a formal mathematical language, but crucially, at the same time, has an intuitive graphical representation.

Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science

1987 ◽  
Vol 10 (4) ◽  
pp. 387-413
Author(s):  
Irène Guessarian
Keyword(s):  
Logic Programming ◽  
Computer Science ◽  
Proof Theory ◽  
Algebraic Structures ◽  
Data Bases

This paper recalls some fixpoint theorems in ordered algebraic structures and surveys some ways in which these theorems are applied in computer science. We describe via examples three main types of applications: in semantics and proof theory, in logic programming and in deductive data bases.

Non-well-founded Proof Theory of Transitive Closure Logic

2020 ◽  
Vol 21 (4) ◽  
pp. 1-31
Author(s):  
Liron Cohen ◽  
Reuben N. S. Rowe
Keyword(s):  
Proof Theory ◽  
Transitive Closure

Ein rekursives Programm für das Kalah-Spiel / A recursive program for the Kalah game

1970 ◽  
Vol 12 (1-6) ◽  
pp. 11-19
Author(s):  
P. Rechenberg
Keyword(s):  
Recursive Program

scholarly journals Induction of recursive program schemes

1998 ◽  
pp. 214-225 ◽  
Author(s):  
Ute Schmid ◽  
Fritz Wysotzki
Keyword(s):  
Recursive Program

Non deterministic recursive program schemes

1977 ◽  
pp. 12-21 ◽  
Author(s):  
A. Annold ◽  
M. Nivat
Keyword(s):  
Recursive Program
Sign in / Sign up

Export Citation Format

Share Document