( en | de | ru )

 

Disambiguation of "Scedrov, Andre"

Author of the publication

copydeleteadd this publication to your clipboard
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities.

, , and . FCT, volume 10472 of Lecture Notes in Computer Science, page 326-340. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Janin Andres

Untersuchungen über Regulationsmechanismen der 11beta-Hydroxysteroid-Dehydrogenase Typ 1. Uni Potsdam, (2008)

Andre Peters

Description and determination of soil hydraulic properties on the laboratory scale. TU Braunschweig, (2008)

Siyka Andreeva

Myriam Andreas

Geertje Andresen

 

Other publications of authors with the same name

On a weakening of Markov's Principle., and . Arch. Math. Log., 23 (1): 153-160 (1983)Some Properties of Epistemic Set Theory with Collection.. J. Symb. Log., 51 (3): 748-754 (1986)Notes on Sconing and Relators., and . CSL, volume 702 of Lecture Notes in Computer Science, page 352-378. Springer, (1992)Formal Analysis of Multiparty Contract Signing., , and . J. Autom. Reason., 36 (1-2): 39-83 (2006)Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus., , and . CONCUR, volume 2761 of Lecture Notes in Computer Science, page 323-345. Springer, (2003)Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols., , , and . FoSSaCS, volume 2987 of Lecture Notes in Computer Science, page 468-483. Springer, (2004)Verifying Confidentiality and Authentication in Kerberos 5., , , and . ISSS, volume 3233 of Lecture Notes in Computer Science, page 1-24. Springer, (2003)Bounded memory protocols., , , and . Comput. Lang. Syst. Struct., 40 (3-4): 137-154 (2014)Functorial Polymorphism., , , and . Theor. Comput. Sci., 70 (1): 35-64 (1990)Uniform Proofs as a Foundation for Logic Programming., , , and . Ann. Pure Appl. Log., 51 (1-2): 125-157 (1991)