Analysis of the Ground Term of Triply Ionized Terbium in Calcium Tungstate

1968 ◽  
Vol 175 (2) ◽  
pp. 488-498 ◽  
Author(s):  
D. E. Wortman
Keyword(s):  
Ground Term ◽  
Calcium Tungstate

Ground‐Term Energy Levels of Triply Ionized Holmium in Calcium Tungstate

1970 ◽  
Vol 53 (3) ◽  
pp. 1247-1257 ◽  
Author(s):  
D. E. Wortman ◽  
David Sanders
Keyword(s):  
Energy Levels ◽  
Ground Term ◽  
Calcium Tungstate ◽  
Term Energy

Deformation by slip in single crystals of calcium tungstate

1964 ◽  
Vol 9 (102) ◽  
pp. 911-916 ◽  
Author(s):  
B. Cockayne ◽  
G. E. Hollox
Keyword(s):  
Single Crystals ◽  
Calcium Tungstate

Luminescence of calcium tungstate crystals

1974 ◽  
Vol 61 (10) ◽  
pp. 4003-4011 ◽  
Author(s):  
Michael J. Treadaway ◽  
Richard C. Powell
Keyword(s):  
Calcium Tungstate

Crucibleless crystal growth and Radioluminescence study of calcium tungstate single crystal fiber

2014 ◽  
Vol 37 ◽  
pp. 51-54 ◽  
Author(s):  
M.S. Silva ◽  
L.M. Jesus ◽  
L.B. Barbosa ◽  
D.R. Ardila ◽  
J.P. Andreeta ◽  
...  
Keyword(s):  
Crystal Growth ◽  
Single Crystal ◽  
Calcium Tungstate ◽  
Crystal Fiber

scholarly journals Nominal Equational Problems

2021 ◽  
pp. 22-41
Author(s):  
Mauricio Ayala-Rincón ◽  
Maribel Fernández ◽  
Daniele Nantes-Sobrinho ◽  
Deivid Vale
Keyword(s):  
General Definition ◽  
Ground Term ◽  
First Order ◽  
Rule Application ◽  
Definition Of ◽  
Term Algebra

AbstractWe define nominal equational problems of the form $$\exists \overline{W} \forall \overline{Y} : P$$ ∃ W ¯ ∀ Y ¯ : P , where $$P$$ P consists of conjunctions and disjunctions of equations $$s\approx _\alpha t$$ s ≈ α t , freshness constraints $$a\#t$$ a # t and their negations: $$s \not \approx _\alpha t$$ s ≉ α t and "Equation missing", where $$a$$ a is an atom and $$s, t$$ s , t nominal terms. We give a general definition of solution and a set of simplification rules to compute solutions in the nominal ground term algebra. For the latter, we define notions of solved form from which solutions can be easily extracted and show that the simplification rules are sound, preserving, and complete. With a particular strategy for rule application, the simplification process terminates and thus specifies an algorithm to solve nominal equational problems. These results generalise previous results obtained by Comon and Lescanne for first-order languages to languages with binding operators. In particular, we show that the problem of deciding the validity of a first-order equational formula in a language with binding operators (i.e., validity modulo $$\alpha $$ α -equality) is decidable.

Sign in / Sign up

Export Citation Format

Share Document