Algorithmic Logic with Stacks and Its Model-Theoretical Properties
In this paper we propose to transform the Algorithmic Theory of Stacks (cf. Salwicki [30]) into a logic for expressing and proving properties of programs with stacks. We compare this logic to the Weak Second Order Logic (cf. [11, 15]) and prove theorems concerning axiomatizability without quantifiers (an analogon of Łoś-Tarski theorem) and χ 0 - categoricity (an analogon of Ryll-Nardzewski’s theorem).
2018 ◽
Keyword(s):
1996 ◽
Vol 160
(1-2)
◽
pp. 87-143
◽
Keyword(s):
Keyword(s):
2000 ◽
Vol 244
(1-2)
◽
pp. 63-94
◽
Keyword(s):
2008 ◽
Vol 6
(3)
◽
pp. 416-442
◽
Keyword(s):