Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 169 for “"Calculi"”.
-
Goodwillie Calculi
"We define an ""algebraic"" version of the Goodwillie tower, Pdn F(X), that depends only on the behaviour of F on coproducts of X. When F is a functor to connected spaces or grouplike H-spaces, the functor Pdn F is the base of a fibration &vbm0;⊥*+1F&vbm0;→ F→P dnF, whose fiber is …
-
Polynomial Time Calculi
This dissertation deals with type systems which guarantee polynomial time complexity of typed programs. Such algorithms are commonly regarded as being feasible for practical applications, because their runtime grows reasonably fast for bigger inputs. The implicit complexity community has proposed …
-
Non-classical propositional calculi
<p>There exist well-known varieties of implication, such as strict, intuitionist, three-valued and rigorous, which are non-classical in the sense of being more restrictive than material implication. But there exists also a type of implication, intuitively plausible, which is nonclassical not only …
-
Hypersequent Calculi for Modal Logics
… theory of modal logics. Traditional sequent calculi for modal logics often fail to have many of the desirable properties that we expect of a sequent calculus. Cut cannot be eliminated from the system for S5, the axioms of each logic are not straightforwardly related to the sequent rules, and …
-
The dissolution of urinary calculi
… solvents for the dissolution of urinary calculi in vitro and Albright’s (1) citric acid buffer and a solvent designated in this investigation simply as “G” (33) were shown to be the most efficient solvents. Further investigation showed that something was necessary to increase the …
-
Graphical calculi and their conjecture synthesis
<p>Categorical Quantum Mechanics, and graphical calculi in particular, has proven to be an intuitive and powerful way to reason about quantum computing. This work continues the exploration of graphical calculi, inside and outside of the quantum computing setting, by investigating the algebraic …
-
Factors Influencing Urinary Calculi in Lambs
… diet) appeared to be the limiting factor in calculi formation with diets containing hay. (See more in text)
-
Logical relation categories and lambda calculi.
… the connection between categories and $\lambda$-calculi that interests computer scientists. This connection is a thread that goes through the whole thesis. (Abstract shortened by UMI.)
-
On the Construction of Propositional Calculi
Made available in DSpace on 2014-12-04T21:18:18Z (GMT). No. of bitstreams: 1 6400550.pdf: 4133385 bytes, checksum: d0d5e0c080b7d3c72aef69c4aedfd62e (MD5) Previous issue date: 1963
-
Completeness of the ZW and ZX calculi
… thesis looks at two quantum motivated graphical calculi, the ZW calculus and ZX calculus. These two calculi are intended to perform qubit calculations using string diagrams. Both calculi are universal in the sense that they are able to represent all qubit maps, but they lack the completeness …
-
Algebraic semantics and calculi for Nelson's logics
The aim of this thesis is to study a family of logics, comprised of Nelson’s logic S, constructive logic with strong negation N 3, quasi-Nelson logic QN and quasi-Nelson implicative logic QN I. This is done in two ways. The first is by means of an axiomatisation via a Hilbert Calculus and the …
-
The disintegration and dissolution of urinary calculi
… as aides in the :in vitro" dissolution of calculi in "G"⁷ solution. This investigation indicated that a more effective solvent was needed.
-
Extracorporeal shock wave lithotripsy for urinary calculi
Contains fulltext : mmubn000001_130539236.pdf (Publisher’s version ) (Open Access)
-
Population based semantics for attribute based Markovian calculi
Process Algebras and Process Description Languages (PDL) have been used to model and analyze concurrent and distributed systems. These approaches first only focused on the qualitative aspects of the computations but then as the modeled systems got more complex and larger in scale new classes of PDL …
-
Computational complexity perspective on graphical calculi for quantum computation
… circuit extraction. Such problems in graphical calculi form a limitation preventing the wider adoption of diagrammatic reasoning. Computational complexity theory formalises the difficulty of problems. For ZX diagrams, the circuit extraction problem is #P-hard and unlikely to have an efficient …
Page 1 of 9