Pure Logic Research Articles

A Low-Voltage Fully Differential Pure Current Mode Current Operational Amplifier

In this paper a novel high-frequency fully differential pure current mode current operational amplifier (COA) is proposed that is, to the authors' knowledge, the first pure MOSFET Current Mode Logic (MCML) COA in the world, so far. Doing fully current mode signal processing and avoiding high impedance nodes in the signal path grant the proposed COA such outstanding properties as high current gain, broad bandwidth, and low voltage and low-power consumption. The principle operation of the block is discussed and its outstanding properties are verified by HSPICE simulations using TSMC $$0.18\,\upmu \hbox {m}$$0.18μm CMOS technology parameters. Pre-layout and Post-layout both plus Monte Carlo simulations are performed under supply voltages of $$\pm 0.75\,\hbox {V}$$±0.75V to investigate its robust performance at the presence of fabrication non-idealities. The pre-layout plus Monte Carlo results are as; 93 dB current gain, $$8.2\,\hbox {MHz}\,\, f_{-3\,\text {dB}}, 89^{\circ }$$8.2MHzf-3dB,89? phase margin, 137 dB CMRR, 13 $$\Omega $$Ω input impedance, $$89\,\hbox {M}\Omega $$89MΩ output impedance and 1.37 mW consumed power. Also post-layout plus Monte Carlo simulation results (that are generally believed to be as reliable and practical as are measuring ones) are extracted that favorably show(in abovementioned order of pre-layout) 88 dB current gain, $$6.9\,\hbox {MHz} f_{-3\text {db}} , 131^{\circ }$$6.9MHzf-3db,131? phase margin and 96 dB CMRR, $$22\,\Omega $$22Ω input impedance, $$33\,\hbox {M}\Omega $$33MΩ output impedance and only 1.43 mW consumed power. These results altogether prove both excellent quality and well resistance of the proposed COA against technology and fabrication non-idealities.

Dealing with Uncertainty in Strategic Decision-making

ABSTRACT: Strategic uncertainty is the disparity between what one knows, and what one needs to know in order to make a responsible decision; it permeates defense decision-making. Because of strategic uncertainty, planners must maximize the robustness against surprise in striving to achieve critical goals. This article describes the decision methodology known as robust-satisfying and the integration of this method with other military decision-making processes. ********** Flipping a fair coin has equal chance of getting heads or tails. Rolling a balanced dice has equal probabilities for each of six A known outcomes. But if we take this into the realm of strategic decision-making and consider the 2002 assessment of Iraqi capability with Weapons of Mass Destruction (WMD), how many outcomes should we ponder: what are they and what are their likelihoods? One might say the answer is binary: Either they do or they do not have WMD. Or, perhaps we should consider multiple possibilities: They have small (or large) quantities, they are (or are not) developing more, and they intend to use it (or not). It is as though we are rolling dice without knowing how many faces each die has, and whether or not each is balanced for equal probabilities of all outcomes. This is essentially the problem every strategist faces, and the one this article proposes to address. We often are justified in thinking probabilistically and in saying something is very likely. For example, Stalin's military advisers in 1941 claimed a German invasion of the Soviet Union was very likely. The advisers had reconnaissance evidence, captured documents, and more. (1) Most analysts (though not Stalin) readily acknowledged the complementary assertion--Germany is not about to invade Russia--was very unlikely. In binary logic, an assertion is either true or false. If we know an assertion is true, then we know the negation of that assertion is false. There is an in binary logic. The excluded middle rules out the possibility an assertion is both true and false. Probabilistic thinking is an extension--to the domain of uncertainty--of the binary thinking of pure logic: If we know an assertion is highly probable, then we know the negation of that assertion is highly unlikely. An assertion and its negation cannot both be highly when using probabilistic reasoning. In strategic affairs, we often do not know enough about the situation to exclude the middle as we routinely do in binary logic and in probabilistic thinking. The British during World War II could have viewed the assertion that Germany was trying to build an atomic bomb as likely (indeed they were). Otto Hahn, who was a war-time professor in Berlin, had visited Enrico Fermi during the latter's experiments with uranium in the 1930s, and Hahn won the 1944 Nobel Prize in Chemistry (awarded in 1945) for his discovery of fission of heavy nuclei. (2) But one could argue the Nazis abjured Jewish physics, such as relativity and quantum theory, and therefore it is unlikely Germany would try to exploit this physics in order to build an atom bomb. Indeed, the Nazis never pursued nuclear weapons as enthusiastically as the Allies. If one needs to say an assertion is both quite and quite unlikely, one must abandon the binary structure of probability. This need arises quite often in strategic affairs. One reason is conflicting intelligence reports are common, as the Prussian military thinker Carl von Clausewitz emphasized. (3) Another reason is we often are unaware of, or do not understand, new doctrinal or technological possibilities. For instance, the possibility and implications of massive infantry use of hand-held Sagger anti-tank ordnance surprised the Israelis in the Yom Kippur War, despite their experiences with similar missiles both as users and as targets. (4) Furthermore, prediction is always difficult, especially in war. …

Better Semantics for the Pure Logic of Ground

Philosophers have spilled a lot of ink over the past few years exploring the nature and significance of grounding. Kit Fine has made several seminal contributions to this discussion, including an exact treatment of the formal features of grounding [Fine, 2012a]. He has specified a language in which grounding claims may be expressed, proposed a system of axioms which capture the relevant formal features, and offered a semantics which interprets the language. Unfortunately, the semantics Fine offers faces a number of problems. In this paper, I review the problems and offer an alternative that avoids them. I offer a semantics for the pure logic of ground that is motivated by ideas already present in the grounding literature, and for which a natural axiomatization capturing central formal features of grounding is sound and complete. I also show how the semantics I offer avoids the problems faced by Fine’s semantics. Philosophers have spilled a lot of ink over the past few years exploring the nature and significance of grounding. Grounding is supposed to be a certain relation of dependence and determination among facts. This relation is linked with a certain kind of explanation. It is targeted by the sort of explanations we give sometimes when we say that some facts obtain in virtue of other facts and when we ask what makes something the case. When, for instance, ethicists ask what makes murder wrong, epistemologists ask what makes my belief that I have hands justified, chemists ask what makes alcohol miscible in water, and physicists ask what makes gravity so weak, they are asking after the worldly conditions on which the facts in question depend, and by which they are determined.

Automated reasoning and presentation support for formalizing mathematics in Mizar

This paper presents a combination of several automated reasoning and proof presentation tools with the Mizar system for formalization of mathematics. The combination forms an online service called MizAR, similar to the SystemOnTPTP service for first-order automated reasoning. The main differences to SystemOnTPTP are the use of the Mizar language that is oriented towards human mathematicians (rather than the pure first-order logic used in SystemOnTPTP), and setting the service in the context of the large Mizar Mathematical Library of previous theorems, definitions, and proofs (rather than the isolated problems that are solved in SystemOnTPTP). These differences poses new challenges and new opportunities for automated reasoning and for proof presentation tools. This paper describes the overall structure of MizAR, and presents the automated reasoning systems and proof presentation tools that are combined to make MizAR a useful mathematical service.

F. A. Hayek and the Economic Calculus

The paper offers a revisionist account of certain episodes in the development of F. A. Hayek's thought. It offers a new reading of his 1937 paper, Economics and Knowledge, that draws on unpublished lecture notes in which he articulated more fully the distinctions he made in the paper between a pure logic of choice, or the economic calculus, and an empirical element, which he would later call the competitive market order. Next, the paper shows that Hayek continued to try to develop his ideas about the role of the economic calculus through the 1950s and early 1960s, an effort that has been missed because it never led to any published work. Finally, the paper examines Hayek's attempt to articulate a theory of the market process, one that would be at the same level of generality as the economic calculus, in lectures he gave at the University of Virginia. He never developed a full-fledged formal theory, but his failed efforts still bore fruit in leading him to his contributions on spontaneous orders and the (verbal) theory of complex phenomena. This work anticipated contributions by others who were more technically trained.

An examination of the SEP candidate analogical inference rule within pure inductive logic

Within the framework of (Unary) Pure Inductive Logic we investigate four possible formulations of a probabilistic principle of analogy based on a template considered by Paul Bartha in the Stanford Encyclopedia of Philosophy [1] and give some characterizations of the probability functions which satisfy them. In addition we investigate an alternative interpretation of analogical support, also considered by Bartha, based not on the enhancement of probability but on the creation of possibility.

F.A. Hayek and the Rationality of Individual Choice

An under-appreciated aspect of F.A. Hayek’s mature views about rationality is the inter-relation of the “pure logic of choice” and rule-following behavior. Sometimes it is asserted that Hayek abandoned his earlier understanding of individual rationality and replaced it with a completely rule-oriented conception of decisionmaking. In fact, however, the analysis in Hayek’s Sensory Order gives us the framework in which the relative roles of explicit choice-logic and rule-following can be discerned. Furthermore, this framework also shows that his fundamental conception of individual rationality is pragmatic, contextual, modifiable, and ecological. While standard neoclassical economists were axiomatizing the explicit logic of choice, Hayek was decades ahead of these economists in understanding the nature of decisionmaking outside of completely artificial worlds in which there are no cognitive limits and in which the structure of the environment is simple. This article attempts to lay the foundation for an integrated understanding of Hayek’s pragmatic rule-following rationality and the “ecological rationality” of Gerd Gigerenzer and other researchers.

Hayek and Praxeology

One of the pillars of Hayekian social thought is Hayek’s contention that study of the market cannot be a priori. But Hayek seems not to have realized the implications of his own conception of the Pure Logic of Choice. He didn’t realize that the method of deductive analysis he envisioned could easily be applied to the market and its various objects and phenomena (prices, interest, etc.).

Inductive theorem proving based on tree grammars

Induction plays a key role in reasoning in many areas of mathematics and computer science. A central problem in the automation of proof by induction is the non-analytic nature of induction invariants. In this paper we present an algorithm for proving universal statements by induction that separates this problem into two phases. The first phase consists of a structural analysis of witness terms of instances of the universal statement. The result of such an analysis is a tree grammar which induces a quantifier-free unification problem which is solved in the second phase. Each solution to this problem is an induction invariant. The arguments and techniques used in this paper heavily exploit a correspondence between tree grammars and proofs already applied successfully to the generation of non-analytic cuts in the setting of pure first-order logic.

THE ANCIENT-GREEK SPECIAL PROBLEMS, AS THE QUANTIZATION MOULDS OF SPACES.

The Special Problems of E-geometry consist the , Mould Quantization , of Euclidean Geometry in it , to become → Monad , through mould of Space –Anti-space in itself , which is the material dipole in inner monad Structure as the Electromagnetic cycloidal field → Linearly , through mould of Parallel Theorem [44- 45] , which are the equal distances between points of parallel and line → In Plane , through mould of Squaring the circle [46] , where the two equal and perpendicular monads consist a Plane acquiring the common Plane-meter → and in Space (volume) , through mould of the Duplication of the Cube [46] , where any two Unequal perpendicular monads acquire the common Space-meter to be twice each other , as analytically all methods are proved and explained . [39-41] 
 The Unification of Space and Energy becomes through [STPL] Geometrical Mould Mechanism of Elements , the minimum Energy-Quanta , In monads → Particles, Anti-particles , Bosons , Gravity – Force , Gravity -Field , Photons , Dark Matter , and Dark-Energy ,consisting Material Dipoles in inner monad Structures i.e. the Electromagnetic Cycloidal Field of monads. [39-41]
 Euclid’s elements consist of assuming a small set of intuitively appealing axioms, proving many other propositions. Because nobody until [9] succeeded to prove the parallel postulate by means of pure geometric logic , many self consistentnon - Euclidean geometries have been discovered , based on Definitions , Axioms or Postulates , in order that none of them contradicts any of the other postulates . In [39] the only Space-Energy geometry is Euclidean , agreeing with the Physical reality , on unit AB = Segment which is The Electromagnetic field of the Quantized on AB Energy Space Vector , on the contrary to the General relativity of Space-time which is based on the rays of the non-Euclidean geometries to the limited velocity of light and Planck`s cavity . Euclidean geometry elucidated the definitions of geometry-content ,{ for Point , Segment , Straight Line , Plane , Volume, Space [S] , Antispace [AS] , Sub-space [SS] , Cave, Space-Anti-Space Mechanism of the Six-Triple-Points-Line , that produces and transfers Points of Spaces , Anti-Spaces and Sub-Spaces in a Common Inertial Sub-Space and a cylinder ,Gravity field [MFMF] , Particles } and describes the Space-Energy beyond Plank´s length level [ Gravity Length 3,969.10 ̄ 62 m ] , reaching the Point = m = 0 m , which is nothing and zero space .[43-46] -The Geometrical solution of the Special Problems is now presented.

Informality and survival in Ukraine's nuclear landscape: Living with the risks of Chernobyl

Recent debates on informal economic activities have partially switched away from a pure monetary logic towards a more complex one, embedded in long term relations and reckoning with non materialistic paradigms. The role of informality in certain aspects of people's lives has however, remained largely unexplored. This article uncovers what happens when the state retires from (providing benefits and social services to) a geographic area and what kind of mechanisms, practices and institutions are created to make up for this. We suggest that, in the face of de facto abandonment by state welfare, and the absence of a private sector alternative, a myriad of transactions and actors can make up for this by replacing these forms of welfare informally. Our case study focuses on the nuclear landscapes around the Chernobyl Exclusion Zone in north–central Ukraine as we reveal the ways the excluded and abandoned, which we frame as post-nuclear “bare life” (Agamben, 1998), have created a mechanism of social security that is independent from the state and yet complements it. Informal, local and unofficial understandings of nuclear spaces are central to survival in this marginalised and risky environment.

A New High-Density Twin-Gate Isolation One-Time Programmable Memory Cell in Pure 28-nm CMOS Logic Process

A new and compact high-k dielectric breakdown one-time programmable (OTP) cell in pure 28-nm high-k metal gate (HKMG) process is proposed. By adopting a self-aligned twin-gate isolation (TGI) made by merged gate spacer, the new OTP cell can operate independently with a very small cell area. Fabricated by a pure 28-nm HKMG CMOS logic process, this OTP cell successfully achieves an ultrasmall cell size of 0.0441 μm 2 on 28-nm HKMG CMOS logic platform. Using high-k dielectric breakdown as its program mechanism, the antifuse TGI OTP memory has more than three orders of ON/OFF read window with a low program voltage of 4 V in 20 μs. Furthermore, a highly density 64-kbit TGI OTP array has been fabricated and successfully demonstrates the new superior isolation and reliability performances.

Graphical Modelling Classification for Construction Project Scheduling

The main goals of graphical modelling and data visualization are to communicate information clearly and effectively through graphical means. Little research has been undertaken in this area and current scheduling methods seem to be unable, individually, to meet all of the planner's needs, to be understood visually, and to be efficient in terms of displaying as much information as possible. We have analyzed the graphical modelling visual parameters and variables, and their associated values (tabular, graphical, colors, shapes, fills, borders, patterns, text, fonts, etc.), defined the graphical approach of existing scheduling methods, and developed a new classification for construction projects’ scheduling. Scheduling methods are classified into seven (7) categories: Table Series, Cross-tabulation Series, Pure Logic Series, Time-Scaled Series, Chrono Series, CAD Series, and Chart Series. This classification illustrates how the information can be presented using different strategies resulting in the presentation of the same project schedule through different compatible approaches. The planner has the ability to switch from one approach to another by changing the graphical parameters. In this way, graphic representation becomes a living, transformable image, thus assisting planners in solving problems of a variable nature, and simplifying site management while simultaneously utilizing the visual space as efficiently as possible.

ON WEAK GROUND

AbstractThough the study of grounding is still in the early stages, Kit Fine, in ”The Pure Logic of Ground”, has made a seminal attempt at formalization. Formalization of this sort is supposed to bring clarity and precision to our theorizing, as it has to the study of other metaphysically important phenomena, like modality and vagueness. Unfortunately, as I will argue, Fine ties the formal treatment of grounding to the obscure notion of a weak ground. The obscurity of weak ground, together with its centrality in Fine’s system, threatens to undermine the extent to which this formalization offers clarity and precision. In this paper, I show how to overcome this problem. I describe a system, the logic of strict ground (LSG) and demonstrate its adequacy; I specify a translation scheme for interpreting Fine’s weak grounding claims; I show that the interpretation verifies all of the principles of Fine’s system; and I show that derivability in Fine’s system can be exactly characterized in terms of derivability in LSG. I conclude that Fine’s system is reducible to LSG.

Design Intelligent System Compensator to Computed Torque Control of Spherical Motor

Spherical three Degree-of- Freedom (DOF) is controlled by model-base fuzzy computed torque controller. The spherical motor has three revolute joints allowing the corresponding parts to move horizontally and vertically. When developing a controller using conventional control methodology (e.g., feedback linearization methodology), a design scheme has to be produced, usually based on a dynamic model. The work outline in this research utilizes soft computing applied to new conventional controller to address these methodology issues. Computed torque controller (CTC) is influential nonlinear controllers to certain systems which this method is based on compute the required arm torque using nonlinear feedback control law. When all dynamic and physical parameters are known, CTC works superbly; practically a large amount of systems have uncertainties and fuzzy feedback Inference Engine (FIS) is used to reduce this kind of limitation. Fuzzy logic provides functional capability without the use of a system dynamic model and has the characteristics suitable for capturing the approximate, varying values found in a MATLAB based area. Based on this research model- base fuzzy computed torque controller applied to spherical motor is presented to have a stable and robust nonlinear controller and have a good result compared with conventional and pure fuzzy logic controllers.

Prior’s OIC nonconservativity example revisited

In his 1964 note, ‘Two Additions to Positive Implication’, A. N. Prior showed that standard axioms governing conjunction yield a nonconservative extension of the pure implicational intermediate logic OIC (order implicational calculus) of R. A. Bull. Here, after reviewing the situation with the aid of an adapted form of the Kripke semantics for intuitionistic and intermediate logics, we proceed to illuminate this example by transposing it to the setting of modal logic, and then relate it to the propositional logic of what have been called ‘Hilbert algebras with infimum’.

Design Serial Intelligent Modified Feedback Linearization like Controller with Application to Spherical Motor

Fuzzy logic controller (FLC) is an important nonlinear controller in an uncertain dynamic parameters. This controller is used to control of nonlinear dynamic systems particularly for spherical motor, because it has a suitable control performance and it is a stable. Conversely pure fuzzy logic controller is a high-quality intelligent nonlinear controller; it has two important problems; reliability and robustness in uncertain dynamic parameter. To increase the reliability and robustness, this research is focused on applied feedback linearization method in pure fuzzy logic controller. In this research the nonlinear equivalent dynamic (equivalent part) formulation problem in uncertain condition is also solved by combine pure fuzzy logic control and feedback linearization method. In this method feedback linearization theorem is applied to fuzzy logic controller to increase the stability, reliability and robustness, which it is based on nonlinear dynamic formulation. To achieve this goal, the dynamic-based formulation feedback linearization method is design. This method is robust and model-based nonlinear control therefore can reduce the nonlinearity term of system and reduce the effect of coupling. In this research MAMDANI fuzzy inference system is used as a main controller. It has minimum rule base to practical implementation. This technique was employed to obtain the desired control behavior with a number of information about dynamic model of system and a feedback linearization control was applied to reinforce system performance.

Bouligand–Severi tangents in MV-algebras

In their important recent paper published in the Annals of Pure and Applied Logic, Dubuc and Poveda call an MV-algebra A strongly semisimple if all principal quotients of A are semisimple. All boolean algebras are strongly semisimple, and so are all finitely presented MV-algebras. We show that for any 1-generator MV-algebra, semisimplicity is equivalent to strong semisimplicity. Further, a semisimple 2-generator MV-algebra A is strongly semisimple if and only if its maximal spectral space \mu(A)\subseteq [0,1]^2 does not have any rational Bouligand–Severi tangents at its rational points. In general, when A is finitely generated and \mu(A)\subseteq [0,1]^n has a Bouligand–Severi tangent then A is not strongly semisimple. An MV-algebra A is strongly semisimple if and only if so is every 2-generator subalgebra of A .

An Error Correcting Method of BCH Code Applicable to Memory

An error correcting method of BCH code applicable to memory is proposed. The reliability and yield of memories can be efficiently improved by error correcting codes. Due to the limited length of data transfer bits in certain interfaces, check bits are not fully used by most BCH codes. The proposed method takes advantage of the nature of BCH codes to make full use of the check bits, so that more errors can be corrected than the original method. The algorithm can be achieved by pure logic circuits in a parallel way with only gate delay, suitable for special timing applications. The improvement of certain BCH code is evaluated by C++ and the hardware implementation is presented by FPGA.

The Meaning of 'Law' in Comparing Laws or the Complexity of What the Object of Legal Comparison Is

The Meaning of 'Law' in Comparing Laws or the Complexity of What the Object of Legal Comparison Is