The proper place for questions about Boolean functions is the Discrete Math subforum.

What you would like to do is to represent a Boolean function f(x, y, z) as a composition of two functions g(x, h(y, z)). Counting the number of all possible compositions, we can see that this is not always possible. Indeed, there are Boolean functions of three arguments and functions of two arguments. If each pair (g, h) of two-argument functions produced a distinct three-argument function (in other words, if the mapping were an injection), then there would also be compositions. However, some compositions of distinct pairs (g, h) produce the same function, e.g., when g(x, y) = x: then h does not matter. Thus, there are fewer than compositions of the form g(x, h(y, z)).

Representing a Boolean function as a composition of two or more functions is called Boolean decompositions, and apparently it is (or was) an active research area. This paper claims that "almost all n-variable functions are undecomposable when n is large." It also has a criterion of decomposition. Let's say we want to represent f(x, y, z) as g(x, h(y, z)). One has to write the Boolean table for f as a 2 x 4 table. Its columns are marked by all possible values of the arguments of the internal function h (here this is y and z), and its rows are marked by the remaining variables (here x). The cells of the table are, of course, the values of f for the corresponding x, y and z. For your second function, the table is the following.

Theorem 2.1 in the paper says that f is decomposable iff there are at most two distinct columns in the table. Here, however, there are three: 01, 11 and 00. Therefore, the function is undecomposable.