Works matching IS 18605974 AND DT 2021 AND VI 17 AND IP 1
Results: 15
2-ADJOINT EQUIVALENCES IN HOMOTOPY TYPE THEORY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(13)2021
- By:
- Publication type:
- Article
AXIOMATIZATIONS OF BETWEENNESS IN ORDER-THEORETIC TREES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(111)2021
- By:
- Publication type:
- Article
AXIOMATIZING MAXIMAL PROGRESS AND DISCRETE TIME.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(11)2021
- By:
- Publication type:
- Article
OUTPUT-SENSITIVE INFORMATION FLOW ANALYSIS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(115)2021
- By:
- Publication type:
- Article
ON THE STRONG EQUIVALENCES FOR LP<sup>MLN</sup> PROGRAMS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(14)2021
- By:
- Publication type:
- Article
COMPUTING PROBABILISTIC BISIMILARITY DISTANCES FOR PROBABILISTIC AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(19)2021
- By:
- Publication type:
- Article
ROBUSTNESS AGAINST TRANSACTIONAL CAUSAL CONSISTENCY.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(112)2021
- By:
- Publication type:
- Article
DETERMINACY IN DISCRETE-BIDDING INFINITE-DURATION GAMES.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(110)2021
- By:
- Publication type:
- Article
MODAL LOGICS FOR NOMINAL TRANSITION SYSTEMS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(16)2021
- By:
- Publication type:
- Article
CORRECT AND EFFICIENT ANTICHAIN ALGORITHMS FOR REFINEMENT CHECKING.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(18)2021
- By:
- Publication type:
- Article
SOLVABILITY = TYPABILITY + INHABITATION.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(17)2021
- By:
- Publication type:
- Article
DEFINABLE DECOMPOSITIONS FOR GRAPHS OF BOUNDED LINEAR CLIQUEWIDTH.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(15)2021
- By:
- Publication type:
- Article
TAMENESS IN LEAST FIXED-POINT LOGIC AND MCCOLM'S CONJECTURE.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(12)2021
- By:
- Publication type:
- Article
CONVOLUTION ALGEBRAS: RELATIONAL CONVOLUTION, GENERALISED MODALITIES AND INCIDENCE ALGEBRAS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(113)2021
- By:
- Publication type:
- Article
THE π-CALCULUS IS BEHAVIOURALLY COMPLETE AND ORBIT-FINITELY EXECUTABLE.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(114)2021
- By:
- Publication type:
- Article