A5006929252- Advanced Algebra and Logic
- Logic, Reasoning, and Knowledge
- Logic, programming, and type systems
- Rough Sets and Fuzzy Logic
- semigroups and automata theory
- Formal Methods in Verification
- Fuzzy and Soft Set Theory
- Computability, Logic, AI Algorithms
- Rings, Modules, and Algebras
- Advanced Topics in Algebra
- graph theory and CDMA systems
- Mathematics and Applications
- Distributed systems and fault tolerance
- Advanced Database Systems and Queries
- Cryptography and Residue Arithmetic
- Security and Verification in Computing
- Coding theory and cryptography
- Homotopy and Cohomology in Algebraic Topology
- Advanced Topology and Set Theory
- Molecular spectroscopy and chirality
- Cryptography and Data Security
- Semantic Web and Ontologies
- Commutative Algebra and Its Applications
- Multi-Agent Systems and Negotiation
- Algebraic structures and combinatorial models
Iowa State University
1995-2018
AMES Group (Spain)
2003
University of Illinois Chicago
1986-1994
University of Pisa
1993
Ames National Laboratory
1974-1991
Justus-Liebig-Universität Gießen
1984
Simon Fraser University
1982
University of Manitoba
1979-1980
Purdue University West Lafayette
1975
Indiana University Bloomington
1971
<inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper Q"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">Q</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {Q}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is any quasivariety. A congruence relation alttext="normal Theta"> mathvariant="normal">Θ<!-- Θ --></mml:mi>...
Object-oriented (OO) programming techniques can be applied to equational specification logics by distinguishing visible data from hidden (that is, the output of methods objects which apply), and then focusing on behavioural equivalence in sense introduced H. Reichel 1984. Equational structured this way are called , HELs. The central problem is how extend a given HEL computationally effective way. S. Buss G. Roşu showed 2000 that not possible general, but much work has been done partial for...
In this essay we discuss Tarski's work on what he called the methodology of deductive sciences , or more briefly, borrowing terminology Hilbert, metamathematics The clearest statement views subject can be found in his textbook Introduction to logic [41 m ]. 1 Here describes tasks as “the detailed analysis and critical evaluation fundamental principles that are applied construction mathematics”. He goes describe these are: All expressions discipline under consideration must defined terms a...