Things could have been different, but could it also have been different what things there are? It is natural to think so, since I could have failed to be born, and it is natural to think that I would then not have been anything. But what about entities like propositions, properties and relations? Had I not been anything, would there have been the property of being me? In this thesis, I formally develop and assess views according to which it is both contingent what individuals there are and contingent what propositions, properties and relations there are. I end up rejecting these views, and conclude that even if it is contingent what individuals there are, it is necessary what propositions, properties and relations there are. Call the view that it is contingent what individuals there are first-order contingentism, and the view that it is contingent what propositions, properties and relations there are higher-order contingentism. I bring together the three major contributions to the literature on higher-order contingentism, which have been developed largely independently of each other, by Kit Fine, Robert Stalnaker, and Timothy Williamson. I show that a version of Stalnaker's approach to higher-order contingentism was already explored in much more technical detail by Fine, and that it stands up well to the major challenges against higher-order contingentism posed by Williamson. I further show that once a mistake in Stalnaker's development is corrected, each of his models of contingently existing propositions corresponds to the propositional fragment of one of Fine's more general models of contingently existing propositions, properties and relations, and vice versa. I also show that Stalnaker's theory of contingently existing propositions is in tension with his own theory of counterfactuals, but not with one of the main competing theories, proposed by David Lewis. Finally, I connect higher-order contingentism to expressive power arguments against first-order contingentism. I argue that there are intelligible distinctions we draw with talk about "possible things", such as the claim that there are uncountably many possible stars. Since first-order contingentists hold that there are no possible stars apart from the actual stars, they face the challenge of paraphrasing such talk. I show that even in an infinitary higher-order modal logic, the claim that there are uncountably many possible stars can only be paraphrased if higher-order contingentism is false. I therefore conclude that even if first-order contingentism is true, higher-order contingentism is false.

Approved for public release; distribution is unlimited / The goal of this thesis is the development of a programmable logic array (PLA) that accepts multiple-valued inputs and produces multiple valued outputs. The PLA is implemented in CMOS and multiple levels are encoded as current. It is programmed by choosing transistor geometries which control the current level at which the PLA reacts to inputs. An example of a 4-valued PLA is shown. As part of this research, a C program was written that produces a PLA layout. / http://archive.org/details/designofmultiple00koyo / Major, Republic of Korea Air Force

In contemporary formal theory of truth, model-theoretic and non-classical approaches have been dominant. I rather pursue the so-called classical axiomatic approaches toward truth and my dissertation begins by arguing for the classical axiomatic approach and against the others. The classical axiomatic approach inevitably leads to abandonment of the nave conception of truth and revision of the basic principles of truth derived from that nave conception such as the full T-schema. In the absence of the general guiding principles based on that nave conception, we need to conduct tedious but down-to-earth eld works' of various theories of truth by examining and comparing them from various points of view in searching for satisfactory theories of truth. As such attempt, I raise two new criteria for comparison of truth theories, make a proof-theoretic study of them in connection to the foundation of mathematics.

Neste trabalho, estudamos algumas formas de combinar sistemas de Lógica Modal, analisando quando a combinação preserva propriedades como correção, completude e decidibilidade. Estendemos um estudo já realizado sobre combinações de sistemas de Lógica Modal Normal para sistemas de Lógica Modal Não-normal. O principal resultado deste trabalho é a preservação de completude da aplicação externa de um sistema de Lógica Modal Não-normal M em um sistema lógico L. Outro resultado importante é um exemplo de interação forte na combinação independente, ou fusão, de dois sistemas de Lógica Modal Não-normal. / In this work, we study a few ways of combining Modal Logic systems, analysing when the combination preserves properties like soundness, completeness and decidability. We extend a study of the combination of Normal Modal Logic systems to Non-normal Modal Logic systems. The main result of this work is the completeness preservation in the external application of a Non-normal Modal Logic system M to a logic system L. Another important result is an example of strong interations arising in the fusion of two Non-normal Modal Logic system.

This Thesis explores building low cost and reliable portable laboratory infrastructure platform for Logic Design, methods for allowing access to modern test equipment via the internet, and issues related to academic integrity. A comprehensive engineering education, per ABET, requires an equal emphasis on both lecture and laboratory components. The laboratory experience builds and establishes a foundation of skills and experiences that the student cannot obtain through any other means. The laboratory must use modern, pertinent methods and techniques including the use of appropriate tools. This is especially true when it comes to test equipment. Engineering students require and deserve training on and access to modern test equipment in order to obtain better career opportunities. However, providing access to modern and relevant labs requires a significant budget commitment. One way to extend current budgets is to adopt the growing concept of “remote labs.” This approach allows higher utilization of existing (and costly) equipment, it improves an institution’s Return on Investment (ROI), and also can be used to meet the needs of students’ complicated schedules, especially in the case of a “commuter campus,” where a majority of students live off campus. By developing remote labs, both the institution and the students benefit: Institutions increase equipment utilization, and utilize space, budgets and support personnel more efficiently. Students can access a lab whenever and wherever they have internet access. Finally, academic integrity must be protected to ensure the potential of remote laboratories in education. This Thesis presents a design and implementation plan for a low cost Logic Design laboratory infrastructure built and tested over 3 years by over 1,500 Logic Design students; a design and implementation of the infrastructure to include the ability to measure using remote test equipment; and the design of a case (3d printed or laser cut) to encapsulate a USB enabled micro-controller; and a scheme to ensure the academic integrity is maintained for in-person, hybrid and fully online classes. / Includes bibliography. / Thesis (M.S.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection

Ho Chi Kit. / Thesis submitted in: September 2005. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 66-70). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.9 / Chapter 1.1 --- Aims and Contribution --- p.9 / Chapter 1.2 --- Dissertation Overview --- p.10 / Chapter 2 --- Literature Review --- p.11 / Chapter 2.1 --- ATPG-based Alternative Wiring --- p.11 / Chapter 2.1.1 --- Post-Layout Logic Restructuring for Performance Optimization --- p.11 / Chapter 2.1.2 --- Timing Optimization by an Improved Redundancy Addition and Removal Technique --- p.12 / Chapter 2.2 --- Logic Synthesis --- p.13 / Chapter 2.2.1 --- Local Logic Substitution Algorithm for Post-Layout Re-synthesis --- p.13 / Chapter 2.2.2 --- SIS: A System for Sequential Circuit Synthesis --- p.13 / Chapter 2.3 --- Fanout Optimization --- p.14 / Chapter 2.3.1 --- Efficient Global Fanout Optimization Algorithms --- p.14 / Chapter 2.3.2 --- Fanout Optimization under a Submicron Transistor-Level Delay Model --- p.15 / Chapter 2.4 --- Genetic Algorithm --- p.15 / Chapter 2.4.1 --- Scalability and Efficiency of Genetic Algorithms for Geometrical Applications --- p.15 / Chapter 2.4.2 --- "The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations" --- p.16 / Chapter 3 --- Background --- p.18 / Chapter 3.1 --- Redundancy Addition and Removal --- p.18 / Chapter 3.2 --- REWIRE --- p.19 / Chapter 4 --- Standard Cell Logic Synthesis --- p.20 / Chapter 4.1 --- Introduction --- p.20 / Chapter 4.2 --- Objective --- p.22 / Chapter 4.3 --- Use Standard Patterns for Logic Synthesis --- p.22 / Chapter 4.4 --- Optimization --- p.25 / Chapter 4.5 --- Proposed Scheme --- p.26 / Chapter 4.6 --- Criteria for Selection of Wire --- p.28 / Chapter 4.7 --- Experimental Results --- p.30 / Chapter 4.8 --- Conclusion --- p.34 / Chapter 5 --- Theory on GBAW --- p.35 / Chapter 5.1 --- Introduction --- p.35 / Chapter 5.2 --- Notations and Definitions --- p.36 / Chapter 5.3 --- Minimality and Duality --- p.37 / Chapter 5.4 --- Topological Property of GBAW patterns --- p.41 / Chapter 5.5 --- Experimental Results --- p.47 / Chapter 5.6 --- Conclusion --- p.51 / Chapter 6 --- Multi-way GBAW Partitioning Scheme --- p.52 / Chapter 6.1 --- Introduction --- p.52 / Chapter 6.2 --- Algorithm of GBAW Partitioning Scheme --- p.55 / Chapter 6.3 --- Experimental Results --- p.56 / Chapter 6.4 --- Conclusion --- p.63 / Chapter 7 --- Conclusion --- p.64 / Bibliography --- p.66

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND HUMANITIES / Bibliography: leaves 175-176. / by Lon A. Berk. / Ph.D.

This thesis presents an interactive computerised teaching suite developed for the design of combinatorial and sequential logic circuits. This suite fills a perceived gap in the currently available computer-based teaching software for digital logic design. Several existing digital logic educational software are available, however these existing programs were found to be unsuitable for our use in providing alternative mode subject delivery. This prompted the development of a Microsoft Windows TM tutorial suite, called WinLogiLab. WinLogiLab comprises of a set of tutorials that uses student provided input data, to perform the initial design steps for digital Combinatorial and Sequential logic circuits. The combinatorial tutorials are designed to show the link between Boolean Algebra and Digital Logic circuits, and follows the initial design steps: from Boolean algebra, truth tables, to Exact and the Heuristic minimisation techniques, to finally produce the combinatorial circuit. Similarly, the sequential tutorials can design simple State Machine Counters, and can model more complex Finite State Automata.

This thesis is concerned with the problem of learning comprehensible theories from structured data and covers primarily classification and regression learning. The basic knowledge representation language is set around a polymorphically-typed, higher-order logic. The general setup is closely related to the learning from propositionalized knowledge and learning from interpretations settings in Inductive Logic Programming. Individuals (also called instances) are represented as terms in the logic. A grammar-like construct called a predicate rewrite system is used to define features in the form of predicates that individuals may or may not satisfy. For learning, decision-tree algorithms of various kinds are adopted.¶ The scope of the thesis spans both theory and practice. On the theoretical side, I study in this thesis¶ 1. the representational power of different function classes and relationships between them;¶ 2. the sample complexity of some commonly-used predicate classes, particularly those involving sets and multisets;¶ 3. the computational complexity of various optimization problems associated with learning and algorithms for solving them; and¶ 4. the (efficient) learnability of different function classes in the PAC and agnostic PAC models.¶ On the practical side, the usefulness of the learning system developed is demontrated with applications in two important domains: bioinformatics and intelligent agents. Specifically, the following are covered in this thesis:¶ 1. a solution to a benchmark multiple-instance learning problem and some useful lessons that can be drawn from it;¶ 2. a successful attempt on a knowledge discovery problem in predictive toxicology, one that can serve as another proof-of-concept that real chemical knowledge can be obtained using symbolic learning;¶ 3. a reworking of an exercise in relational reinforcement learning and some new insights and techniques we learned for this interesting problem; and¶ 4. a general approach for personalizing user agents that takes full advantage of symbolic learning.

Current-controlled logic and single electron logic processors have been investigated with respect to thermal-induced bit error. A maximal error rate for both logic processors is regarded as one bit-error/year/chip. A maximal clock frequency and an information channel capacity at a given operation current are derived when a current-controlled logic processor works without error. An available operation range in a current-controlled processor with 100 million elements is discussed. The dependence of an error-free condition on temperature in single electron logic processors is derived. The size of the quantum dot of single electron transistor is predicted when a single electron logic processor with the a billion single electron transistors works without error at room temperature.