A constructive version of the Sylvester–Gallai theorem

2016 ◽  
Vol 150 (1) ◽  
pp. 121-130
Author(s):  
M. Mandelkern
Keyword(s):  
Constructive Version

Analysis of the Combustion Air Preheater from the Aluminum Melting Furnaces

2016 ◽  
Vol 14 (11) ◽  
pp. 27-32
Author(s):  
Aurel Gaba ◽  
Vasile Bratu ◽  
Dorian Musat ◽  
Ileana Nicoleta Popescu ◽  
Maria Cristiana Enescu
Keyword(s):  
Mathematical Model ◽  
Heat Exchanger ◽  
Computer Program ◽  
Flue Gas ◽  
Heat Recovery ◽  
Melting Furnace ◽  
Operating Conditions ◽  
Air Preheater ◽  
Constructive Version ◽  
Scrap Aluminum

Abstract This paper presents solutions and the equipment for preheating combustion air from scrap aluminum melting furnaces through flue gas heat recovery. For sizing convection pre-heaters, there has been developed a mathematical model which has been transcribed into a computer program in C + +. A constructive version of the pre-heater was drawn up and a recovery heat exchanger was manufactured and mounted on an aluminum melting furnace. Both the functional parameters values and the reasons causing the pre-heater worning out, as well as the steps taken for sizing and the achievement of a new air pre-heater able to bear the operating conditions of the aluminum melting furnace are shown.

Combinator realizability of a constructive Morse set theory

1974 ◽  
Vol 39 (2) ◽  
pp. 226-234
Author(s):  
John Staples
Keyword(s):  
Set Theory ◽  
Predicate Calculus ◽  
Constructive Version

A constructive version of Morse set theory is given, based on Heyting's predicate calculus and with countable rather than full choice. An elaboration of the method of [5] is used to show that the theory is combinator-realizable in the sense defined there. The proof depends on the assumption of the syntactic consistency of the theory.The method is introduced by first treating a subtheory without countable choice of foundation.It is intended that the work can be read either classically or constructively, though whether the word constructive is correctly used as a description of either the theory or the metatheory is of course a matter of opinion.

scholarly journals Modal logic and the approximation induction principle

2012 ◽  
Vol 22 (2) ◽  
pp. 175-201 ◽  
Author(s):  
MACIEJ GAZDA ◽  
WAN FOKKINK
Keyword(s):  
Modal Logic ◽  
Upper Bounds ◽  
Compactness Theorem ◽  
Projection Operators ◽  
Sufficient Condition ◽  
Induction Principle ◽  
Constructive Version ◽  
Trace Semantics

We prove a compactness theorem in the context of Hennessy–Milner logic and use it to derive a sufficient condition on modal characterisations for the approximation induction principle to be sound modulo the corresponding process equivalence. We show that this condition is necessary when the equivalence in question is compositional with respect to the projection operators. Furthermore, we derive different upper bounds for the constructive version of the approximation induction principle with respect to simulation and decorated trace semantics.

scholarly journals A constructive version of Tarski's geometry

2015 ◽  
Vol 166 (11) ◽  
pp. 1199-1273 ◽  
Author(s):  
Michael Beeson
Keyword(s):  
Constructive Version

scholarly journals Realizing Suleimanova-type Spectra via Permutative Matrices

2016 ◽  
Vol 31 ◽  
pp. 306-312 ◽  
Author(s):  
Pietro Paparella
Keyword(s):  
Direct Sum ◽  
Constructive Version ◽  
Square Matrix

A permutative matrix is a square matrix such that every row is a permutation of the first row. A constructive version of a result attributed to Sule˘ımanova is given via permutative matrices. A well-known result is strenghthened by showing that all realizable spectra containing at most four elements can be realized by a permutative matrix or by a direct sum of permutative matrices. The paper concludes by posing a problem.

Contributions to the Constructive Optimization of an Orientation Module in the Structure of the TRR Industrial Robot

2012 ◽  
Vol 245 ◽  
pp. 267-273
Author(s):  
Silviu Mihai Petrişor ◽  
Ghiţă Bârsan
Keyword(s):  
Optimum Design ◽  
Degrees Of Freedom ◽  
Industrial Robot ◽  
Dynamic Modelling ◽  
3D Modelling ◽  
Robotic Arm ◽  
Lagrangian Formalism ◽  
Mechanical Structure ◽  
Constructive Version ◽  
Selection Of

The author of the present paper proposes a constructive version, selected on the grounds of dynamic and organological equations, which enables an optimum design and operation of the (MO Sil) orientation module that possesses two degrees of freedom, to which the prehension device is attached, in the mechanical structure of the TRR-type serial modular industrial robot. This paper aims at highlighting the dynamic modelling of the mechanical structure of the TRR-type robot by using Lagrangian formalism, with aspects regarding the MO Sil module’s organological construction as well as with the 3D modelling of the orientation module in the mechanical structure of the robotic arm. Another important issue that this paper deals with is the mathematical-organological algorithm used for the selection of the servomotors actuating the orientation movable system in the mechanical structure of the robot.

scholarly journals A Proof of Constructive Version of Brouwer's Fixed Point Theorem with Uniform Sequential Continuity

2011 ◽  
Vol 2011 ◽  
pp. 1-9
Author(s):  
Yasuhito Tanaka
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Point Theorem ◽  
Uniform Continuity ◽  
Constructive Mathematics ◽  
Sperner’S Lemma ◽  
Brouwer’S Fixed Point Theorem ◽  
Constructive Version ◽  
Sequential Continuity ◽  
Brouwer's Fixed Point Theorem

It is often said that Brouwer's fixed point theorem cannot be constructively proved. On the other hand, Sperner's lemma, which is used to prove Brouwer's theorem, can be constructively proved. Some authors have presented a constructive (or an approximate) version of Brouwer's fixed point theorem using Sperner's lemma. They, however, assume uniform continuity of functions. We consider uniform sequential continuity of functions. In classical mathematics, uniform continuity and uniform sequential continuity are equivalent. In constructive mathematics a la Bishop, however, uniform sequential continuity is weaker than uniform continuity. We will prove a constructive version of Brouwer's fixed point theorem in an n-dimensional simplex for uniformly sequentially continuous functions. We follow the Bishop style constructive mathematics.

ON THE PROPOSITIONAL SLDNF-RESOLUTION

1996 ◽  
Vol 07 (04) ◽  
pp. 359-406 ◽  
Author(s):  
JAN A. PLAZA
Keyword(s):  
Propositional Logic ◽  
Modal Logics ◽  
Logic Programs ◽  
Negation As Failure ◽  
Intermediate Logics ◽  
Original Program ◽  
Declarative Semantics ◽  
Constructive Version ◽  
Fix Point ◽  
Multivalued Semantics

We consider propositional logic programs with negations. We define notions of constructive transformation and constructive completion of a program. We use these notions to characterize SLDNF-resolution in classical, intuitionistic and intermediate logics, and also to derive a characterization in modal logics of knowledge. We show that the three-valued and four-valued fix-point or declarative semantics for program P are equivalent to the two-valued semantics for the constructive version of P. We argue that it would be beneficial to replace Negation as Failure by constructive transformation, and it would be beneficial to use the semantics for the constructive version of the program instead of multivalued semantics for the original program.

Sign in / Sign up

Export Citation Format

Share Document