Pages that link to "Item:Q2277248"
From MaRDI portal
The following pages link to On strictly arithmetical completeness in logics of programs (Q2277248):
Displaying 10 items.
- Strict completion of logic programs (Q751309) (← links)
- Axiomatizing fixpoint logics (Q1190508) (← links)
- A theory of strict P-completeness (Q1337145) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758) (← links)
- A Function Elimination Method for Checking Satisfiability of Arithmetical Logics (Q2968852) (← links)
- On the Completeness of Dynamic Logic (Q3617722) (← links)
- A Complete Axiomatization of Computer Arithmetic (Q3694696) (← links)
- (Q4325363) (← links)
- (Q4797374) (← links)