Pages that link to "Item:Q1106839"
From MaRDI portal
The following pages link to Some relationships between logics of programs and complexity theory (Q1106839):
Displaying 13 items.
- On the power of deep pushdown stacks (Q1037618) (← links)
- ``During'' cannot be expressed by ``after'' (Q1085154) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Logical and schematic characterization of complexity classes (Q1323362) (← links)
- On the relationship between TMS and logic programs (Q1333372) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- On strictly arithmetical completeness in logics of programs (Q2277248) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- Program Schemes with Deep Pushdown Storage (Q3507414) (← links)
- (Q3827989) (← links)
- Computing on structures (Q4630296) (← links)
- Complexity of proving program correctness (Q5096233) (← links)