OBSERVATIONALLY-INDUCED ALGEBRAS IN DOMAIN THEORY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:18)2014
- By:
- Publication type:
- Article
Works matching IS 18605974 AND DT 2014 AND VI 10 AND IP 3
Results: 25
1
2
WHEN IS A CONTAINER A COMONAD?
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:14)2014
- By:
- Publication type:
- Article
3
RANDOM STRINGS AND TRUTH-TABLE DEGREES OF TURING COMPLETE C.E. SETS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:15)2014
- By:
- Publication type:
- Article
4
CONSTRUCTING CATEGORIES AND SETOIDS OF SETOIDS IN TYPE THEORY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:25)2014
- By:
- Publication type:
- Article
5
ANALYSIS OF TIMED AND LONG-RUN OBJECTIVES FOR MARKOV AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:17)2014
- By:
- Publication type:
- Article
6
CORECURSIVE ALGEBRAS, CORECURSIVE MONADS AND BLOOM MONADS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:19)2014
- By:
- Publication type:
- Article
7
COMPUTABLE JORDAN DECOMPOSITION OF LINEAR CONTINUOUS FUNCTIONALS ON C[0; 1].
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:13)2014
- By:
- Publication type:
- Article
8
REPRESENTATIONS OF MEASURABLE SETS IN COMPUTABLE MEASURE THEORY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:7)2014
- By:
- Publication type:
- Article
9
CATEGORICAL PROOF THEORY OF CO-INTUITIONISTIC LINEAR LOGIC.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:16)2014
- By:
- Publication type:
- Article
10
IMPROVING LEGIBILITY OF NATURAL DEDUCTION PROOFS IS NOT TRIVIAL.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:23)2014
- By:
- Publication type:
- Article
11
POLYNOMIAL INTERPRETATIONS OVER THE NATURAL, RATIONAL AND REAL NUMBERS REVISITED.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:22)2014
- By:
- Publication type:
- Article
12
DECIDABILITY RESULTS FOR THE BOUNDEDNESS PROBLEM.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:2)2014
- By:
- Publication type:
- Article
13
REDUCTIONS TO THE SET OF RANDOM STRINGS: THE RESOURCE-BOUNDED CASE.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:5)2014
- By:
- Publication type:
- Article
14
FOURIER SPECTRA OF MEASURES ASSOCIATED WITH ALGORITHMICALLY RANDOM BROWNIAN MOTION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:20)2014
- By:
- Publication type:
- Article
15
A CONCURRENT PATTERN CALCULUS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:10)2014
- By:
- Publication type:
- Article
16
CLASSICAL PROPOSITIONAL LOGIC AND DECIDABILITY OF VARIABLES IN INTUITIONISTIC PROPOSITIONAL LOGIC.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:1)2014
- By:
- Publication type:
- Article
17
AUTOMATA THEORY IN NOMINAL SETS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:4)2014
- By:
- Publication type:
- Article
18
INFERRING ALGEBRAIC EFFECTS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:21)2014
- By:
- Publication type:
- Article
19
ON SEPARATION BY LOCALLY TESTABLE AND LOCALLY THRESHOLD TESTABLE LANGUAGES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:24)2014
- By:
- Publication type:
- Article
20
DECIDING CONDITIONAL TERMINATION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:8)2014
- By:
- Publication type:
- Article
21
REFINEMENT AND DIFFERENCE FOR PROBABILISTIC AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:11)2014
- By:
- Publication type:
- Article
22
A FRAGMENT OF DEPENDENCE LOGIC CAPTURING POLYNOMIAL TIME.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:3)2014
- By:
- Publication type:
- Article
23
AMBIGUITY OF ω -LANGUAGES OF TURING MACHINES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:12)2014
- By:
- Publication type:
- Article
24
ON RAMSEY PROPERTIES OF CLASSES WITH FORBIDDEN TREES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:9)2014
- By:
- Publication type:
- Article
25
FINITE STATE VERIFIERS WITH CONSTANT RANDOMNESS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2014, v. 10, n. 3, p. 1, doi. 10.2168/LMCS-10(3:6)2014
- By:
- Publication type:
- Article