STRONG TURING DEGREES FOR ADDITIVE BSS RAM'S.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:25)2013
- By:
- Publication type:
- Article
Works matching IS 18605974 AND DT 2013 AND VI 9 AND IP 4
Results: 26
1
2
HANDLING ALGEBRAIC EFFECTS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:23)2013
- By:
- Publication type:
- Article
3
ORDERED MODELS OF THE LAMBDA CALCULUS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:21)2013
- By:
- Publication type:
- Article
4
NOMINAL COALGEBRAIC DATA TYPES WITH APPLICATIONS TO LAMBDA CALCULUS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:20)2013
- By:
- Publication type:
- Article
5
MODELING AND VERIFICATION OF INFINITE SYSTEMS WITH RESOURCES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:22)2013
- By:
- Publication type:
- Article
6
ALL LINEAR-TIME CONGRUENCES FOR FAMILIAR OPERATORS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:11)2013
- By:
- Publication type:
- Article
7
UNDECIDABLE FIRST-ORDER THEORIES OF AFFINE GEOMETRIES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:26)2013
- By:
- Publication type:
- Article
8
EXPANSIONS OF MSO BY CARDINALITY RELATIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:18)2013
- By:
- Publication type:
- Article
9
HERBRAND-CONFLUENCE.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:24)2013
- By:
- Publication type:
- Article
10
COMPACT MANIFOLDS WITH COMPUTABLE BOUNDARIES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:19)2013
- By:
- Publication type:
- Article
11
COALGEBRAIC TRACE SEMANTICS FOR CONTINUOUS PROBABILISTIC TRANSITION SYSTEMS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:16)2013
- By:
- Publication type:
- Article
12
APPROXIMATION SYSTEMS FOR FUNCTIONS IN TOPOLOGICAL AND IN METRIC SPACES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:15)2013
- By:
- Publication type:
- Article
13
PRODUCTS OF EFFECTIVE TOPOLOGICAL SPACES AND A UNIFORMLY COMPUTABLE TYCHONOFF THEOREM.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:14)2013
- By:
- Publication type:
- Article
14
AVOIDING SHARED CLOCKS IN NETWORKS OF TIMED AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:13)2013
- By:
- Publication type:
- Article
15
STEP-INDEXED RELATIONAL REASONING FOR COUNTABLE NONDETERMINISM.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:4)2013
- By:
- Publication type:
- Article
16
NON-IDEMPOTENT INTERSECTION TYPES AND STRONG NORMALISATION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:3)2013
- By:
- Publication type:
- Article
17
PARTIAL MODEL CHECKING USING NETWORKS OF LABELLED TRANSITION SYSTEMS AND BOOLEAN EQUATION SYSTEMS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:1)2013
- By:
- Publication type:
- Article
18
POLYNOMIAL PATH ORDERS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:9)2013
- By:
- Publication type:
- Article
19
IMPLICIT RESOLUTION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:7)2013
- By:
- Publication type:
- Article
20
SATISFIABILITY GAMES FOR BRANCHING-TIME LOGICS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:5)2013
- By:
- Publication type:
- Article
21
RELATION LIFTING, WITH AN APPLICATION TO THE MANY-VALUED COVER MODALITY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:8)2013
- By:
- Publication type:
- Article
22
PRICED TIMED PETRI NETS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:10)2013
- By:
- Publication type:
- Article
23
INCARNATION IN LUDICS AND MAXIMAL CLIQUES OF PATHS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:6)2013
- By:
- Publication type:
- Article
24
EPISTEMIC UPDATES ON ALGEBRAS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:17)2013
- By:
- Publication type:
- Article
25
LOWER BOUNDS FOR EXISTENTIAL PEBBLE GAMES AND k-CONSISTENCY TESTS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:2)2013
- By:
- Publication type:
- Article
26
DEFINABILITY OF LINEAR EQUATION SYSTEMS OVER GROUPS AND RINGS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 4, p. 1, doi. 10.2168/LMCS-9(4:12)2013
- By:
- Publication type:
- Article