Lines Matching defs:first
6 simple theorems. You probably should begin with first-order logic
234 As the first step, we apply \tdx{FalseE}:
383 \index{examples!of theories} This example theory extends first-order
464 constants $tt$ and~$ff$. (In first-order logic, booleans are
603 defines concrete syntax for a conditional whose first argument cannot have
705 \subsection{Extending first-order logic with the natural numbers}
708 Section\ts\ref{sec:logical-syntax} has formalized a first-order logic,
750 Primitive recursion appears to pose difficulties: first-order logic has no
1052 Theory \thydx{Prolog} extends first-order logic in order to make use
1089 At this point, the first two elements of the result are~$a$ and~$b$.
1122 quickly find the first solution, namely $x=[]$ and $y=[a,b,c,d]$:
1161 \subsection{Depth-first search}
1162 \index{search!depth-first}
1221 Since Prolog uses depth-first search, this tactic is a (slow!)