Pages that link to "Item:Q5049034"
From MaRDI portal
The following pages link to Fields of Logic and Computation III (Q5049034):
Displaying 21 items.
- To Yuri at 80 and More than 40 Years of Friendship (Q5049035) (← links)
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems (Q5049036) (← links)
- Why Predicative Sets? (Q5049037) (← links)
- Functional Thesauri, Classifying Topoi, Unification, and Flatness (Q5049038) (← links)
- Parameterized Parallel Computing and First-Order Logic (Q5049039) (← links)
- Betweenness in Order-Theoretic Trees (Q5049040) (← links)
- Relativization of Gurevich’s Conjectures (Q5049042) (← links)
- Seventy Years of Computer Science (Q5049043) (← links)
- Convergence and Nonconvergence Laws for Random Expansions of Product Structures (Q5049045) (← links)
- Medieval Arabic Notions of Algorithm: Some Further Raw Evidence (Q5049046) (← links)
- On the Generalized Membership Problem in Relatively Hyperbolic Groups (Q5049047) (← links)
- Identities of the Kauffman Monoid $$\mathcal {K}_4$$ and of the Jones Monoid $$\mathcal {J}_4$$ (Q5049049) (← links)
- Relativistic Effects Can Be Used to Achieve a Universal Square-Root (Or Even Faster) Computation Speedup (Q5049050) (← links)
- Towards Verifying Logic Programs in the Input Language of clingo (Q5049051) (← links)
- Computing on Lattice-Ordered Abelian Groups (Q5049052) (← links)
- The Expressive Power of Temporal and First-Order Metric Logics (Q5049053) (← links)
- Two First-Order Theories of Ordinals (Q5049054) (← links)
- Randomness Tests: Theory and Practice (Q5049055) (← links)
- On Entropic Convergence of Algorithms (Q5049056) (← links)
- The Power of Spreadsheet Computations (Q5049057) (← links)
- Non-Algorithmic Theory of Randomness (Q5049058) (← links)
