Pages that link to "Item:Q1171876"
From MaRDI portal
The following pages link to Definability by programs in first-order structures (Q1171876):
Displaying 9 items.
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- Weakly expressive models for Hoare logic (Q805248) (← links)
- Some questions about expressiveness and relative completeness in Hoare's logic (Q1064046) (← links)
- The unwind property for programs with bounded memory (Q1067771) (← links)
- ``During'' cannot be expressed by ``after'' (Q1085154) (← links)
- Definability by programs in first-order structures (Q1171876) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- An infinite pebble game and applications (Q1362906) (← links)
- Program correctness on finite fields (Q2563951) (← links)
