External links
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
   | This article about an American mathematician is a stub. You can help Wikipedia by expanding it. |
Roger Maddux (born 1948) is an American mathematician specializing in algebraic logic.
He completed his B.A. at Pomona College in 1969, and his Ph.D. in mathematics at the University of California, Berkeley in 1978, where he was one of Alfred Tarski's last students. His career has been at Iowa State University, where he fills a joint appointment in computer science and mathematics.
Maddux is primarily known for his work in relation algebras and cylindric algebras, and as the inventor of relational bases. [1] [2]
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
| | This article about an American mathematician is a stub. You can help Wikipedia by expanding it. |
In mathematics, a binary relation associates elements of one set, called the domain, with elements of another set, called the codomain. A binary relation over sets X and Y is a new set of ordered pairs (x, y) consisting of elements x in X and y in Y. It is a generalization of the more widely understood idea of a unary function. It encodes the common concept of relation: an element x is related to an element y, if and only if the pair (x, y) belongs to the set of ordered pairs that defines the binary relation. A binary relation is the most studied special case n = 2 of an n-ary relation over sets X1, ..., Xn, which is a subset of the Cartesian product
Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".
In mathematics, a finitary relation over sets X1, ..., Xn is a subset of the Cartesian product X1 × ⋯ × Xn; that is, it is a set of n-tuples (x1, ..., xn) consisting of elements xi in Xi. Typically, the relation describes a possible connection between the elements of an n-tuple. For example, the relation "x is divisible by y and z" consists of the set of 3-tuples such that when substituted to x, y and z, respectively, make the sentence true.
Alfred Tarski was a Polish-American logician and mathematician. A prolific author best known for his work on model theory, metamathematics, and algebraic logic, he also contributed to abstract algebra, topology, geometry, measure theory, mathematical logic, set theory, and analytic philosophy.
Modal logic is a kind of logic used to represent statements about necessity and possibility. It plays a major role in philosophy and related fields as a tool for understanding concepts such as knowledge, obligation, and causation. For instance, in epistemic modal logic, the formula can be used to represent the statement that is known. In deontic modal logic, that same formula can represent that is a moral obligation. Modal logic considers the inferences that modal statements give rise to. For instance, most epistemic logics treat the formula as a tautology, representing the principle that only true statements can count as knowledge.
Joseph Amadee Goguen was an American computer scientist. He was professor of Computer Science at the University of California and University of Oxford, and held research positions at IBM and SRI International.
Grigore Constantin Moisil was a Romanian mathematician, computer pioneer, and titular member of the Romanian Academy. His research was mainly in the fields of mathematical logic, algebraic logic, MV-algebra, and differential equations. He is viewed as the father of computer science in Romania.
In mathematics and abstract algebra, a relation algebra is a residuated Boolean algebra expanded with an involution called converse, a unary operation. The motivating example of a relation algebra is the algebra 2 X 2 of all binary relations on a set X, that is, subsets of the cartesian square X2, with R•S interpreted as the usual composition of binary relations R and S, and with the converse of R as the converse relation.
The term "information algebra" refers to mathematical techniques of information processing. Classical information theory goes back to Claude Shannon. It is a theory of information transmission, looking at communication and storage. However, it has not been considered so far that information comes from different sources and that it is therefore usually combined. It has furthermore been neglected in classical information theory that one wants to extract those parts out of a piece of information that are relevant to specific questions.
In the mathematics of binary relations, the composition of relations is the forming of a new binary relation R; S from two given binary relations R and S. In the calculus of relations, the composition of relations is called relative multiplication, and its result is called a relative product. Function composition is the special case of composition of relations where all relations involved are functions.
In logic, especially mathematical logic, a signature lists and describes the non-logical symbols of a formal language. In universal algebra, a signature lists the operations that characterize an algebraic structure. In model theory, signatures are used for both purposes. They are rarely made explicit in more philosophical treatments of logic.
In mathematics, the notion of cylindric algebra, invented by Alfred Tarski, arises naturally in the algebraization of first-order logic with equality. This is comparable to the role Boolean algebras play for propositional logic. Cylindric algebras are Boolean algebras equipped with additional cylindrification operations that model quantification and equality. They differ from polyadic algebras in that the latter do not model equality.
In mathematical logic, algebraic logic is the reasoning obtained by manipulating equations with free variables.
Codd's theorem states that relational algebra and the domain-independent relational calculus queries, two well-known foundational query languages for the relational model, are precisely equivalent in expressive power. That is, a database query can be formulated in one language if and only if it can be expressed in the other.
Gunther Schmidt is a German mathematician who works also in informatics.
RAMiCS, the International Conference on Relational and Algebraic Methods in Computer Science, is an academic conference organized every eighteen months by an international steering committee and held in different locations mainly in Europe, but also in other continents. Like most theoretical computer science conferences, its contributions are strongly peer-reviewed. Proceedings of the conferences appear in Lecture Notes in Computer Science, and some of the stronger papers have been published in Journal of Logical and Algebraic Methods in Programming.
Rudolf Berghammer is a German mathematician who works in computer science.
Victor Witold Marek, formerly Wiktor Witold Marek known as Witek Marek is a Polish mathematician and computer scientist working in the fields of theoretical computer science and mathematical logic.
J. Michael Dunn was Oscar Ewing Professor Emeritus of Philosophy, Professor Emeritus of Informatics and Computer Science, was twice chair of the Philosophy Department, was Executive Associate Dean of the College of Arts and Sciences, and was founding dean of the School of Informatics at Indiana University.
Hajnal Ilona Andréka is a Hungarian mathematician specializing in algebraic logic. She is a research professor emeritus at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.