A mechanistic study of cyclohexene hydrogenation over platinum catalyst using the predicate calculus of mathematical logic

1970 ◽  
Vol 16 (1) ◽  
pp. 27-31
Author(s):  
F. Nagy ◽  
D. Moger ◽  
G. Mink ◽  
I. Nemes
2011 ◽  
Vol 21 (4) ◽  
pp. 671-677 ◽  
Author(s):  
GÉRARD HUET

This special issue of Mathematical Structures in Computer Science is devoted to the theme of ‘Interactive theorem proving and the formalisation of mathematics’.The formalisation of mathematics started at the turn of the 20th century when mathematical logic emerged from the work of Frege and his contemporaries with the invention of the formal notation for mathematical statements called predicate calculus. This notation allowed the formulation of abstract general statements over possibly infinite domains in a uniform way, and thus went well beyond propositional calculus, which goes back to Aristotle and only allowed tautologies over unquantified statements.


1944 ◽  
Vol 9 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Theodore Hailperin

One of the preeminent problems confronting logicians is that of constructing a system of logic which will be adequate for mathematics. By a system's being adequate for mathematics, we mean that all mathematical theorems in general use can be deduced within the system. Several distinct logical systems, all having this end in view, have been proposed. Among these perhaps the best known are the systems referred to as “Principia Mathematica” and “set theory.” In both of these systems (we refer to the revised and simplified versions) there is a nucleus of propositions which can be derived by using only the axioms and rules of the restricted predicate calculus. However, if anything like adequacy for mathematics is to be expected, additional primitives and axioms must be added to the restricted predicate calculus. It is in their treatment of the additional primitive ε, denoting class or set membership, that the above-mentioned systems differ.In addition to these two, a third and a stronger system has been proposed by W. V. Quine in his paper New foundations for mathematical logic. It is with this system of Quine's that our work is concerned and of which we now give a brief description.


1959 ◽  
Vol 2 (1) ◽  
pp. 33-42
Author(s):  
Abraham Robinson

The extended completeness theorem of the predicate calculas of the first order. In section 12, we developed a deductive theory of the first order predicate calculus, while in section II we dealt with the semantic theory of that calculus. We now have to consider the connection between these two theories. We recall that a sentence X can be satisfied by a structure M only if X is defined in M. Given a sentence X (a set of sentences K) we shall say that the structure M is a model of X (of K) if X is (all the sentences of K are) satisfied by M.


Author(s):  
Epameinondas Gasparis

We present LePUS, a formal language for modeling object oriented (O-O) Design patterns. We demonstrate the language’s unique efficacy in producing precise, concise, generic, and appropriately abstract specifications that effectively model the Gang of Four’s Design patterns. Mathematical logic is used as a main frame of reference: LePUS is defined as a subset of first-order predicate calculus and implementations (programs) are modeled as finite structures in model theory. We also demonstrate the conceptual framework in which the verification of implementations against pattern specifications is possible and our ongoing endeavour to develop effective tool support for LePUS.


2001 ◽  
Vol 120 (5) ◽  
pp. A145-A145
Author(s):  
C CHO ◽  
Y YE ◽  
E LIU ◽  
V SHIN ◽  
N SHAM

Sign in / Sign up

Export Citation Format

Share Document