Pages that link to "Item:Q1187648"
From MaRDI portal
The following pages link to Computability, complexity, logic. Transl. from the German (Q1187648):
Displaying 10 items.
- A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency (Q598579) (← links)
- Free objects and equational deduction for partial conditional specifications (Q673184) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- (Q3673102) (← links)
- A finitely axiomatizable undecidable equational theory with recursively solvable word problems (Q4955722) (← links)
- Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)
- Algorithmic complexity for theories of commutative Kleene algebras (Q6492397) (← links)