The following pages link to Andrej Scedrov (Q1052316):
Displaying 50 items.
- (Q456471) (redirect page) (← links)
- (Q1171569) (redirect page) (← links)
- Maintaining distributed logic programs incrementally (Q456472) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Moez Alimohamed, 1967--1994 (Q673119) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Functorial polymorphism (Q753948) (← links)
- (Q793722) (redirect page) (← links)
- Set existence property for intuitionistic theories with dependent choice (Q793723) (← links)
- Corrigendum to ``Set existence property for intuitionistic theories with dependent choice'' (Q793724) (← links)
- Differential equations in constructive analysis and in the recursive realizability topos (Q793725) (← links)
- Large sets in intuitionistic set theory (Q796524) (← links)
- Formal analysis of Kerberos 5 (Q860899) (← links)
- Formal analysis of multiparty contract signing (Q861699) (← links)
- Classifying topoi and finite forcing (Q1052317) (← links)
- On some non-classical extensions of second-order intuitionistic propositional calculus (Q1061123) (← links)
- The lack of definable witnesses and provably recursive functions in intuitionistic set theories (Q1071017) (← links)
- Arithmetic transfinite induction and recursive well-orderings (Q1071019) (← links)
- Diagonalization of continuous matrices as a representation of intuitionistic reals (Q1086560) (← links)
- Lindenbaum algebras of intuitionistic theories and free categories (Q1092043) (← links)
- Embedding sheaf models for set theory into Boolean-valued permutation models with an interior operator (Q1096625) (← links)
- On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis (Q1102283) (← links)
- Kleene computable functionals and the higher order existence property (Q1104319) (← links)
- The ''World's simplest axiom of choice'' fails (Q1171570) (← links)
- Inheritance as implicit coercion (Q1175335) (← links)
- Complete topoi representing models of set theory (Q1192330) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Linearizing intuitionistic implication (Q1210141) (← links)
- An extension of system \(F\) with subtyping (Q1322473) (← links)
- First-order linear logic without modalities is NEXPTIME-hard (Q1342252) (← links)
- Phase semantics for light linear logic (Q1398478) (← links)
- Optimization complexity of linear logic proof games (Q1575867) (← links)
- Undecidability of the Lambek calculus with subexponential and bracket modalities (Q1679987) (← links)
- A logical framework with commutative and non-commutative subexponentials (Q1799082) (← links)
- Intuitionistically provable recursive well-orderings (Q1820780) (← links)
- Boolean classifying topoi (Q1835669) (← links)
- The undecidability of second order multiplicative linear logic (Q1917079) (← links)
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
- Soft subexponentials and multiplexing (Q2096472) (← links)
- Non-associative, non-commutative multi-modal linear logic (Q2104536) (← links)
- On the complexity of verification of time-sensitive distributed systems (Q2154017) (← links)
- A multiset rewriting model for specifying and verifying timing aspects of security protocols (Q2303374) (← links)
- The complexity of multiplicative-additive Lambek calculus: 25 years later (Q2303602) (← links)
- L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit (Q2303603) (← links)
- Bounded memory protocols (Q2339157) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Automated analysis of cryptographic assumptions in generic group models (Q2423840) (← links)
- Breaking and fixing public-key Kerberos (Q2482453) (← links)
- Contract signing, optimism, and advantage (Q2484408) (← links)
- Uniform proofs as a foundation for logic programming (Q2640596) (← links)
