Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Andrej Scedrov - MaRDI portal

Andrej Scedrov

From MaRDI portal
(Redirected from Person:456471)
Person:1052316

Available identifiers

zbMath Open scedrov.andreDBLP39/3354WikidataQ57284889 ScholiaQ57284889MaRDI QIDQ1052316

List of research outcomes





PublicationDate of PublicationType
Explorations in Subexponential Non-associative Non-commutative Linear Logic2024-03-14Paper
Undecidability of a newly proposed calculus for CatLog32024-02-06Paper
On the formalization and computational complexity of resilience problems for cyber-physical systems2023-07-28Paper
Explorations in Subexponential non-associative non-commutative Linear Logic (extended version)2023-07-06Paper
Bracket induction for Lambek calculus with bracket modalities2023-06-12Paper
Non-associative, non-commutative multi-modal linear logic2022-12-07Paper
Soft subexponentials and multiplexing2022-11-09Paper
An extension of system F with subtyping2022-08-16Paper
On the complexity of verification of time-sensitive distributed systems2022-07-13Paper
Language models for some extensions of the Lambek calculus2022-06-13Paper
Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos2022-03-09Paper
Soundness of Formal Encryption in the Presence of Key-Cycles2022-03-09Paper
The multiplicative-additive Lambek calculus with subexponential and bracket modalities2021-06-25Paper
Language Models for Some Extensions of the Lambek Calculus2020-07-31Paper
https://portal.mardi4nfdi.de/entity/Q51119132020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51113182020-05-26Paper
Reconciling Lambek’s restriction, cut-elimination and substitution in the presence of exponential modalities2020-04-29Paper
The complexity of multiplicative-additive Lambek calculus: 25 years later2020-03-04Paper
L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit2020-03-04Paper
A multiset rewriting model for specifying and verifying timing aspects of security protocols2020-03-03Paper
Subexponentials in non-commutative linear logic2019-10-09Paper
Automated analysis of cryptographic assumptions in generic group models2019-06-20Paper
A logical framework with commutative and non-commutative subexponentials2018-10-18Paper
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems2018-02-16Paper
Undecidability of the Lambek calculus with subexponential and bracket modalities2017-11-22Paper
On Lambek’s Restriction in the Presence of Exponential Modalities2017-07-21Paper
A rewriting framework and logic for activities subject to regulations2017-04-03Paper
Undecidability of the Lambek Calculus with a Relevant Modality2016-12-01Paper
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities2016-08-07Paper
Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds2015-08-27Paper
Bounded memory protocols2015-03-31Paper
Brief announcement2014-12-05Paper
Bounded memory Dolev-Yao adversaries in collaborative systems2014-10-20Paper
Automated Analysis of Cryptographic Assumptions in Generic Group Models2014-08-07Paper
Relating State-Based and Process-Based Concurrency through Linear Logic2013-05-03Paper
A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols2013-04-26Paper
Maintaining distributed logic programs incrementally2012-10-25Paper
Reduction-Based Formal Analysis of BGP Instances2012-06-29Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
Relating state-based and process-based concurrency through linear logic (full-version)2009-10-09Paper
Breaking and fixing public-key Kerberos2008-04-16Paper
Foundations of Software Science and Computation Structures2007-09-28Paper
Theory of Cryptography2007-02-12Paper
Formal analysis of multiparty contract signing2007-01-30Paper
Formal analysis of Kerberos 52007-01-09Paper
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols2006-04-28Paper
Contract signing, optimism, and advantage2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q44185892003-08-11Paper
Phase semantics for light linear logic2003-07-29Paper
Optimization complexity of linear logic proof games2000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q42228931998-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42228371998-12-13Paper
https://portal.mardi4nfdi.de/entity/Q43956141998-11-01Paper
Linear Logic Proof Games and Optimization1997-05-25Paper
Moez Alimohamed, 1967--19941997-02-28Paper
The undecidability of second order multiplicative linear logic1996-12-05Paper
https://portal.mardi4nfdi.de/entity/Q48553391996-04-16Paper
https://portal.mardi4nfdi.de/entity/Q48429721996-01-21Paper
https://portal.mardi4nfdi.de/entity/Q48425401995-08-14Paper
First-order linear logic without modalities is NEXPTIME-hard1995-01-11Paper
An extension of system \(F\) with subtyping1994-06-09Paper
https://portal.mardi4nfdi.de/entity/Q42832461994-03-10Paper
https://portal.mardi4nfdi.de/entity/Q40353101993-05-18Paper
Linearizing intuitionistic implication1993-05-16Paper
Complete topoi representing models of set theory1992-09-27Paper
Decision problems for propositional linear logic1992-09-27Paper
Bounded linear logic: A modular approach to polynomial-time computability1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40103571992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39957201992-09-17Paper
Inheritance as implicit coercion1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47126511992-06-25Paper
Uniform proofs as a foundation for logic programming1991-01-01Paper
Functorial polymorphism1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34865431990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30352541989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32040241989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32044451989-01-01Paper
Freyd’s models for the independence of the axiom of choice1989-01-01Paper
Kleene computable functionals and the higher order existence property1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37958311988-01-01Paper
Decompositions of finitely generated modules over C(X): sheaf semantics and a decision procedure1988-01-01Paper
Lindenbaum algebras of intuitionistic theories and free categories1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38160731987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38265511987-01-01Paper
Diagonalization of continuous matrices as a representation of intuitionistic reals1986-01-01Paper
Embedding sheaf models for set theory into Boolean-valued permutation models with an interior operator1986-01-01Paper
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis1986-01-01Paper
Intuitionistically provable recursive well-orderings1986-01-01Paper
On the quantificational logic of intuitionistic set theory1986-01-01Paper
Some properties of epistemic set theory with collection1986-01-01Paper
Small decidable sheaves1986-01-01Paper
The lack of definable witnesses and provably recursive functions in intuitionistic set theories1985-01-01Paper
Arithmetic transfinite induction and recursive well-orderings1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36867101985-01-01Paper
Corrigendum to ``Set existence property for intuitionistic theories with dependent choice1984-01-01Paper
Differential equations in constructive analysis and in the recursive realizability topos1984-01-01Paper
Large sets in intuitionistic set theory1984-01-01Paper
On some non-classical extensions of second-order intuitionistic propositional calculus1984-01-01Paper
Forcing and classifying topoi1984-01-01Paper
Church's thesis, continuity, and set theory1984-01-01Paper
Set existence property for intuitionistic theories with dependent choice1983-01-01Paper
Classifying topoi and finite forcing1983-01-01Paper
Boolean classifying topoi1983-01-01Paper
On a weakening of Markov's Principle1983-01-01Paper
The World's simplest axiom of choice fails1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33106191982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33106201982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39125761981-01-01Paper

Research outcomes over time

This page was built for person: Andrej Scedrov