Measurement-Theoretic Foundations of Gradable-Predicate Logic

2012 ◽  
pp. 82-95 ◽  
Author(s):  
Satoru Suzuki
Keyword(s):  
Predicate Logic ◽  
Theoretic Foundations

Study on Edge Contact Area and Surface Integrity of Workpiece in Point Grinding Process

2009 ◽  
Vol 407-408 ◽  
pp. 577-581
Author(s):  
Shi Chao Xiu ◽  
Zhi Jie Geng ◽  
Guang Qi Cai
Keyword(s):  
Surface Integrity ◽  
Contact Area ◽  
High Speed ◽  
Ground Surface ◽  
Depth Of Cut ◽  
Grinding Wheel ◽  
Grinding Process ◽  
Edge Contact ◽  
Cylindrical Grinding ◽  
Theoretic Foundations

During cylindrical grinding process, the geometric configuration and size of the edge contact area between the grinding wheel and workpiece have the heavy effects on the workpiece surface integrity. In consideration of the differences between the point grinding and the conventional high speed cylindrical grinding, the geometric and mathematic models of the edge contact area in point grinding were established. Based on the models, the numerical simulation for the edge contact area was performed. By means of the point grinding experiment, the effect mechanism of the edge contact area on the ground surface integrity was investigated. These will offer the applied theoretic foundations for optimizing the point grinding angles, depth of cut, wheel and workpiece speed, geometrical configuration and size of CBN wheel and some other grinding parameters in point grinding process.

AN INTENSIONAL LEIBNIZ SEMANTICS FOR ARISTOTELIAN LOGIC

2010 ◽  
Vol 3 (2) ◽  
pp. 262-272 ◽  
Author(s):  
KLAUS GLASHOFF
Keyword(s):  
Natural Deduction ◽  
Predicate Logic ◽  
Formal System ◽  
Aristotelian Logic ◽  
Categorical Logic ◽  
Characteristic Numbers ◽  
Formal Syntax ◽  
Philosophical Standpoint ◽  
Classical Philosophy

Since Frege’s predicate logical transcription of Aristotelian categorical logic, the standard semantics of Aristotelian logic considers terms as standing for sets of individuals. From a philosophical standpoint, this extensional model poses problems: There exist serious doubts that Aristotle’s terms were meant to refer always to sets, that is, entities composed of individuals. Classical philosophy up to Leibniz and Kant had a different view on this question—they looked at terms as standing for concepts (“Begriffe”). In 1972, Corcoran presented a formal system for Aristotelian logic containing a calculus of natural deduction, while, with respect to semantics, he still made use of an extensional interpretation. In this paper we deal with a simple intensional semantics for Corcoran’s syntax—intensional in the sense that no individuals are needed for the construction of a complete Tarski model of Aristotelian syntax. Instead, we view concepts as containing or excluding other, “higher” concepts—corresponding to the idea which Leibniz used in the construction of his characteristic numbers. Thus, this paper is an addendum to Corcoran’s work, furnishing his formal syntax with an adequate semantics which is free from presuppositions which have entered into modern interpretations of Aristotle’s theory via predicate logic.

Syllogism and quantification

1962 ◽  
Vol 27 (1) ◽  
pp. 58-72 ◽  
Author(s):  
Timothy Smiley
Keyword(s):  
Predicate Logic ◽  
Modern Logic ◽  
First Order ◽  
First Order Predicate Logic

Anyone who reads Aristotle, knowing something about modern logic and nothing about its history, must ask himself why the syllogistic cannot be translated as it stands into the logic of quantification. It is now more than twenty years since the invention of the requisite framework, the logic of many-sorted quantification.In the familiar first-order predicate logic generality is expressed by means of variables and quantifiers, and each interpretation of the system is based upon the choice of some class over which the variables may range, the only restriction placed on this ‘domain of individuals’ being that it should not be empty.

Some logical and syntactical observations concerning the first-order dependent type system λP

1999 ◽  
Vol 9 (4) ◽  
pp. 335-359 ◽  
Author(s):  
HERMAN GEUVERS ◽  
ERIK BARENDSEN
Keyword(s):  
Predicate Logic ◽  
Type System ◽  
Logical Framework ◽  
First Order ◽  
Logical Derivation ◽  
Dependent Type ◽  
First Order Predicate Logic

We look at two different ways of interpreting logic in the dependent type system λP. The first is by a direct formulas-as-types interpretation à la Howard where the logical derivation rules are mapped to derivation rules in the type system. The second is by viewing λP as a Logical Framework, following Harper et al. (1987) and Harper et al. (1993). The type system is then used as the meta-language in which various logics can be coded.We give a (brief) overview of known (syntactical) results about λP. Then we discuss two issues in some more detail. The first is the completeness of the formulas-as-types embedding of minimal first-order predicate logic into λP. This is a remarkably complicated issue, a first proof of which appeared in Geuvers (1993), following ideas in Barendsen and Geuvers (1989) and Swaen (1989). The second issue is the minimality of λP as a logical framework. We will show that some of the rules are actually superfluous (even though they contribute nicely to the generality of the presentation of λP).At the same time we will attempt to provide a gentle introduction to λP and its various aspects and we will try to use little inside knowledge.

Evidential Decision Theory

2021 ◽  
Author(s):  
Arif Ahmed
Keyword(s):  
Decision Making ◽  
Decision Theory ◽  
Rational Decision ◽  
Evidential Decision Theory ◽  
Radical Theory ◽  
Rational Decision Making ◽  
Evidential Decision ◽  
Theoretic Foundations

Evidential Decision Theory is a radical theory of rational decision-making. It recommends that instead of thinking about what your decisions *cause*, you should think about what they *reveal*. This Element explains in simple terms why thinking in this way makes a big difference, and argues that doing so makes for *better* decisions. An appendix gives an intuitive explanation of the measure-theoretic foundations of Evidential Decision Theory.

Sign in / Sign up

Export Citation Format

Share Document