WHAT DOES 람다원자핵 MEAN IN KOREAN?
Click to
see the original definition of «람다원자핵» in the Korean dictionary.
Click to
see the automatic translation of the definition in English.
Definition of 람다원자핵 in the Korean dictionary
The lambda nucleus Λ is a nucleus formed by the particle entering the nucleus. It is one of the hypertonic nuclei. The Λ particles are very useful for nuclear structure studies because they can fall to the lowest orbit because the exclusion principle of Pauli does not work with the nucleus. The Λ nuclei formed by the capture of two Λ particles were also found. 람다원자핵 Λ입자가 원자핵 속에 들어감으로써 생긴 원자핵이다. 하이퍼론 원자핵의 하나이다. Λ입자는 핵자와의 사이에 파울리의 배타원리가 작용하지 않기 때문에 최저궤도까지 떨어질 수 있으므로 핵구조 연구에 큰 도움이 된다. 2개의 Λ입자가 포획(捕獲)되어 생긴 Λ원자핵도 발견되었다.
Click to
see the original definition of «람다원자핵» in the Korean dictionary.
Click to
see the automatic translation of the definition in English.
10 KOREAN BOOKS RELATING TO «람다원자핵»
Discover the use of
람다원자핵 in the following bibliographical selection. Books relating to
람다원자핵 and brief extracts from same to provide context of its use in Korean literature.
1
Proof and Computation - 36페이지
(all x (all m (all b (all c (imp (all a” (imp (imp (atom (delta-seq a”)) (atom (((((blegal a”) x) b) c) m))) (imp (imp (imp (atom (delta-seq a”)) (atom false)) (atom ((((unsolvable x) b) c) m))) (atom false)))) (atom false)))))) (lambda (x) ((((seq-ind-at (all x ...
Helmut Schwichtenberg, 2012
2
Typed Lambda Calculi and Applications: 9th International ... - 26페이지
If p1, p2 have value the states s1, s2, we will interpret p1 Up2 as the union s1 U 82 of the two sets of atoms s1, s2, minus all atoms of 82 which are inconsistent with some atom of S1. S1 U.S2 is an asymmetrical Operation: whenever an atom of ...
Pierre-Louis Curien, 2009
3
Lambda Calculus with Types - 351페이지
A short introduction to ILC (in its combinatory version) can be found in B[1984], Appendix B. 6.3 Proof theory Lambda terms for natural deduction, sequent ... In Herbelin (1995) a form I atom ] form—>form atom I p ] atom' 6.3 Proof theory 351.
Henk Barendregt, Wil Dekkers, Richard Statman, 2013
4
Typed Lambda Calculi and Applications: Third International ...
Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings ... An atom type is either a type variable or a type of the form a A, where a is a constructor variable and A are ...
Philippe de Groote, J. Roger Hindley, 1997
5
Algorithmic Information Theory - 65페이지
expression ('((FIRSTATOM)((LAMBDA)((X))((COND)(((ATOM)(X))(X) )(((QUOTE><T>)((FIRSTATOM)<(CAR>(X)))>)))) F: ((FIRSTATOM)((LAMBDA)((X))((COND)(((ATOM)(X))(X))( ((QUOTE)(T))((FIRSTATOM)((cAR)(X)))))>) t APPEND ...
6
Typed Lambda Calculi and Applications: International ... - 6페이지
International Conference on Typed Lambda Calculi and Applications, TLCA '93, March 16-18, 1993, Utrecht, The ... is a finite sequence of 1 or r ; u7(l < i < k) is a finite sequence of terms; and s is either an atom, a /3-redex or a /-redex(/ = 1 or r).
Marc Bezem, Jan F. Groote, 1993
7
Exploring RANDOMNESS - 70페이지
p q) [is p a prefix of q2] if atom p true if atom q false if = car p car q (is-prefix? cdr p car q) false let (loop t) [run for time t expr ... (lambda (p) (lo op (+ t 1)))) (debug (append p (cons (read-bit) ni l)))) (loop (+ t 1)))))) (look-for p pairs)))) (de bug (car ...
8
Typed Lambda Calculi and Applications: 7th International ... - 250페이지
Here we use the indices only to distinguish different atom occurrences (i.e., 03 and a^ are not different atoms but different occurrences of the same atom a). For more general cases of W , we can consider the edges to be decorated with ...
9
Typed Lambda Calculi and Applications: 4th International ... - 78페이지
on — a for some atom a. Each member of NSS(T) is called a negative subpremise-sequence. Every non-atomic X-term X can be expressed uniquely in the form A = At 1 ... a.m.v.) 1... Yn, (m + n > 1). The head and arguments of X are ...
10
ML for the Working Programmer - 383페이지
structure DisplayTerm : DISPLAY-TERM = struct (*Free variable in a term*) fun vars (Lambda. Free a) = [a] | vars (Lambda. Bound ... Free a ) = Pretty . str a | atom / = Pretty .blo (I, [Pretty .str" (", term t , Pretty. str" ) " ] ) ; fun pr t = Pretty. pr ( TextIO .
Lawrence C. Paulson, 1996