Open Access. Powered by Scholars. Published by Universities.®
- Keyword
- Publication
- Publication Type
- File Type
Articles 1 - 3 of 3
Full-Text Articles in Algebra
Randomized Detection Of Extraneous Factors, Manfred Minimair
Randomized Detection Of Extraneous Factors, Manfred Minimair
Manfred Minimair
A projection operator of a system of parametric polynomials is a polynomial in the coefficients of the system that vanishes if the system has a common root. The projection operator is a multiple of the resultant of the system, and the factors of the projection operator that are not contained in the resultant are called extraneous factors. The main contribution of this work is to provide a randomized algorithm to check whether a factor is extraneous, which is an important task in applications. A lower bound for the success probability is determined which can be set arbitrarily close to one. …
Construction Algorithms For Expander Graphs, Vlad S. Burca
Construction Algorithms For Expander Graphs, Vlad S. Burca
Senior Theses and Projects
Graphs are mathematical objects that are comprised of nodes and edges that connect them. In computer science they are used to model concepts that exhibit network behaviors, such as social networks, communication paths or computer networks. In practice, it is desired that these graphs retain two main properties: sparseness and high connectivity. This is equivalent to having relatively short distances between two nodes but with an overall small number of edges. These graphs are called expander graphs and the main motivation behind studying them is the efficient network structure that they can produce due to their properties. We are specifically …
A Proof-Theoretic Semantic Analysis Of Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić
A Proof-Theoretic Semantic Analysis Of Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić
Engineering Faculty Articles and Research
The present paper provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best known members of a family of logical systems which have been successfully applied to diverse scientific disciplines, but the proof theoretic treatment of which presents many difficulties. After an illustration of the proof-theoretic semantic principles most relevant to the treatment of logical connectives, we turn to illustrating the main features of display calculi, a proof-theoretic paradigm which has been successfully employed to give a proof-theoretic semantic account of modal and substructural …