Works matching IS 18605974 AND DT 2021 AND VI 17 AND IP 2
Results: 23
COALGEBRAIC SEMANTICS FOR PROBABILISTIC LOGIC PROGRAMMING.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:2)2021
- By:
- Publication type:
- Article
ALGEBRAIC LANGUAGE THEORY FOR EILENBERG-MOORE ALGEBRAS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:6)2021
- By:
- Publication type:
- Article
PREDICATIVE THEORIES OF CONTINUOUS LATTICES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:22)2021
- By:
- Publication type:
- Article
SUPERPOSITION FOR LAMBDA-FREE HIGHER-ORDER LOGIC.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:1)2021
- By:
- Publication type:
- Article
FAILURE TRACE SEMANTICS FOR A PROCESS ALGEBRA WITH TIME-OUTS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:11)2021
- By:
- Publication type:
- Article
INTERFACE MODELING FOR QUALITY AND RESOURCE MANAGEMENT.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:19)2021
- By:
- Publication type:
- Article
CONSTRUCTING HIGHER INDUCTIVE TYPES AS GROUPOID QUOTIENTS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:8)2021
- By:
- Publication type:
- Article
DISCOVERING EPASSPORT VULNERABILITIES USING BISIMILARITY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:24)2021
- By:
- Publication type:
- Article
THEORIES OF REAL ADDITION WITH AND WITHOUT A PREDICATE FOR INTEGERS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:18)2021
- By:
- Publication type:
- Article
STAR GAMES AND HYDRAS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:20)2021
- By:
- Publication type:
- Article
DRAT AND PROPAGATION REDUNDANCY PROOFS WITHOUT NEW VARIABLES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:12)2021
- By:
- Publication type:
- Article
PARTIALLY ORDERED AUTOMATA AND PIECEWISE TESTABILITY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:14)2021
- By:
- Publication type:
- Article
DIRECT SPECTRA OF BISHOP SPACES AND THEIR LIMITS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:4)2021
- By:
- Publication type:
- Article
LNL-FPC: THE LINEAR/NON-LINEAR FIXPOINT CALCULUS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:9)2021
- By:
- Publication type:
- Article
A REALIZABILITY SEMANTICS FOR INDUCTIVE FORMAL TOPOLOGIES, CHURCH'S THESIS AND AXIOM OF CHOICE.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:21)2021
- By:
- Publication type:
- Article
COMPUTABLE ANALYSIS AND NOTIONS OF CONTINUITY IN COQ.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:16)2021
- By:
- Publication type:
- Article
LOGIC FOR EXACT REAL ARITHMETIC.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:7)2021
- By:
- Publication type:
- Article
PARAMETRIC UPDATES IN PARAMETRIC TIMED AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:13)2021
- By:
- Publication type:
- Article
ALGEBRAIC COCOMPLETENESS AND FINITARY FUNCTORS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:23)2021
- By:
- Publication type:
- Article
SCULPTURES IN CONCURRENCY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:5)2021
- By:
- Publication type:
- Article
DECIDABILITY FOR ENTAILMENTS OF SYMBOLIC HEAPS WITH ARRAYS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:15)2021
- By:
- Publication type:
- Article
REACHABILITY SWITCHING GAMES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:10)2021
- By:
- Publication type:
- Article
SEMIPULLBACKS OF LABELLED MARKOV PROCESSES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 2, p. 1, doi. 10.23638/LMCS-17(2:3)2021
- By:
- Publication type:
- Article