The following pages link to (Q4856946):
Displaying 14 items.
- Proof-finding algorithms for classical and subclassical propositional logics (Q1049689) (← links)
- Semantics for dual and symmetric combinatory calculi (Q1826434) (← links)
- Some lambda calculus and type theory formalized (Q1961921) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- Proof-theoretic semantics for classical mathematics (Q2500813) (← links)
- The classical \(\lambda\)-calculus characteristics and their application for the effective outcome of the logic equations (Q2745139) (← links)
- (Q3475243) (← links)
- (Q3714050) (← links)
- (Q4449007) (← links)
- On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic (Q4627723) (← links)
- A-translation and looping combinators in pure type systems (Q4764266) (← links)
- (Q4867684) (← links)
- Classical logic with Mendler induction (Q5108017) (← links)
- Typed Lambda Calculi and Applications (Q5704010) (← links)