Skip to search formSkip to main contentSkip to account menu

System U

Known as: Girard's paradox, System U− 
In mathematical logic, System U and System U− are pure type systems, i.e. special forms of a typed lambda calculus with an arbitrary number of sorts… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Curry–Howard correspondenceFirst-class functionIntuitionistic type theoryKind (type theory)

Broader (2)

Lambda calculusType theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A family of improved Falkner-type methods for oscillatory systems
2016
2016
A second-order parareal algorithm for fractional PDEs
2015
2015
Oscillation theorems for linear matrix Hamiltonian systems
2011
2011
39.2: Polarization Conversion System Using a Polymer Polarization Grating
We describe a new Polarization Conversion System (PCS) concept, particularly well suited for pico‐projectors, employing a polymer… 
2008
2008
Geometry of Linear Differential Systems Towards Contact Geometry of Second Order
This is a lecture note on the geometry of linear differential systems. By a (linear) differential system (or Pfaffian system) (M… 
2007
2007
Application of Singular Value Decomposition Technique to System Identification by Doping an Optimum Signal
This paper proposes a system identification methodology by using eigensystem realization algorithm (ERA) with a doping signal… 
2000
2000
Adaptive control for feedback-linearized missiles with uncertainties
A robust adaptive control scheme is proposed that can be applied to a practical autopilot design for feedback-linearized skid-to… 
1996
1996
Orderly Thinking about a Chaotic System.
This chapter examines the ways in which community college policy makers at all levels can come to understand the diversity of… 
1977
1977
An Automatic Position Recognition Technique for LSI Assembly
A fully automatic LSI wire-bonding system utilizing image processing techniques is described. The position recognition system… 
1973
1973
The ordinals of the systems of second order arithmetic with the provably Δ 2 1 -comprehension axiom and with the Δ 2 1 -comprehension axiom respectively
Definition 1.15. A proof of second order arithmetic in the tree form formulation with G L C as its logical basis (see [5] for the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)