A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Logic of Sequentiality
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
In this paper, we develop a detailed analysis of the structure of these strategies from a logical perspective by showing that they correspond to proofs in a new kind of affine logic. ...
We describe the semantics of our logic formally by giving a notion of categorical model and an instance based on a simple category of games. ...
Our work attempts to give a logical description of such strategies. ...
doi:10.1007/978-3-642-15205-4_19
fatcat:6q55s6nrtvdorjei5tfb6fyqgm
On the Unity of Logic: a Sequential, Unpolarized Approach
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The present work aims to give a unity of logic via standard sequential, unpolarized games. ...
In search for the truly linear refinement of CL, we carve out (a sequent calculus of) linear logic negative (LL^-) from (the two-sided sequent calculus of) LL, and introducing a new distribution axiom ...
of IL into ILL, giving a sequential, unpolarized unity of logic (n.b., classicalization is the inverse of intuitionistic restriction). ...
arXiv:1912.07462v1
fatcat:pr52yibw2fhmnefuc3o5cztkra
A Deontic Action Logic with Sequential Composition of Actions
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Then we discuss the validity of formulas constructed in a language with a finite number of basic actions, parallel and sequential compositions of actions, a free choice operator and the standard deontic ...
The main achievements of the paper are definitions of metalogical counterparts of deontic operators and interpretation function of actions taking into account their terminating and non-terminating executions ...
In the present paper we want to extend the semantics of our systems on transitions between situations and extend the language of our deontic action logic with sequential composition of actions. ...
doi:10.1007/978-3-642-31570-1_13
fatcat:6a26dqvuh5cg7i5zllrozfpdam
A Purely Logical Account of Sequentiality in Proof Search
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The process algebra is a minimal restriction of CCS to parallel and sequential composition; the logical system is a minimal extension of multiplicative linear logic. ...
This way we get the first purely logical account of sequentiality in proof search. ...
This non-commutative operator, called seq, has a resemblance to the prefix combinator of CCS [14] ; it is a form of sequential composition, similar to other sequential constructs in other languages. ...
doi:10.1007/3-540-45619-8_21
fatcat:ghkc6bchqne23dacayzuqibdcu
Design of a Ternary Edge-Triggered D Flip-Flap-Flop for Multiple-Valued Sequential Logic
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The basic element of sequential logic is Flip-Flop, which stores an input value and returns two outputs (Q and Q_bar). ...
Development of large computerized systems requires both combinational and sequential circuits. ...
The Proposed Design The basic memory core in sequential logic is called latch. The well-known R-S latch is a pair of cross-coupled NOR gates. ...
arXiv:1609.03897v3
fatcat:r6k2nn5q3ngp5gocs2xz7jlsc4
Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer
[article]
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Such a Sequential Quantum Logic (SQL) was developed in the late 70's and has more recently been applied to the consistent histories framework of quantum mechanics as a possible route to the theory of quantum ...
This suggests that the underlying logic of quantum computing may be an algebra of sequences of quantum measurements rather than an algebra of products of unitary operators. ...
Acknowledgments: I would like to thank Howard Barnum and Elham Kashefi for useful discussions and Rob Spekkens for comments on an earlier version of this manuscript. ...
arXiv:quant-ph/0509193v1
fatcat:yfpquxubbzgrzhlaelxppceykq
Designing sequential transcription logic: a simple genetic circuit for conditional memory
2007
Journal of Systems and Synthetic Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
However, our results suggest that such sequential logic elements may be readily implemented by cells through the combination of existing protein-protein interactions and simple transcriptional regulation ...
Here, we propose a simple genetic circuit in bacteria that is capable of conditionally memorizing a signal in the form of a transcription factor concentration. ...
Timmer (University of Freiburg) for guidance and support during his diploma thesis. NB acknowledges a Burroughs-Wellcome Fund CASI award, TH acknowledges support by the NSF through Grant No. ...
doi:10.1007/s11693-007-9006-8
pmid:19003438
pmcid:PMC2533522
fatcat:rd34kbny6nc7vjp2vnusnqvcgm
A study of some tense logics by Gentzen's sequential method
1980
Publications of the Research Institute for Mathematical Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Completeness First of all, we review the semantics for tense logic. ...
the traditional tense logics K t and K t 4. ...
doi:10.2977/prims/1195187208
fatcat:pok5tx2rhnanbmkputpcqic32i
Growing Commas. A Study of Sequentiality and Concatenation
2009
Notre Dame Journal of Formal Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We determine a reasonable extension of TC that is sequential, i.e., has a good sequence coding. C A Model without a Tally 23 2 ...
In his paper [Grz05], Andrzej Grzegorczyk introduces a theory of concatenation TC. We show that TC does not define pairing. ...
We borrow some ideas from the proof of Lemma 6.5 of a forthcoming paper by Harvey Friedman, called The Inevitability of Logical Strength: Strict Reverse Mathematics. ...
doi:10.1215/00294527-2008-028
fatcat:uawnhjggtfcntbdv2tznv7hxgm
A Constant-Space Sequential Model of Computation for First-Order Logic
1998
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We define and justify a natural sequential model of computation with a constant amount of read write work space, despite unlimited (polynomial) access to read-only input and write-only output. ...
We show that computation on this model is equivalent to expressibility in first-order logic, giving a duality between (read-once) constant-space serial algorithms and constant-time parallel algorithms. ...
using tape heads instead of the random-access method I was using). ...
doi:10.1006/inco.1998.2702
fatcat:whcebmo7yjek3mshmpo3w723he
A sequential abstract machine for flat concurrent prolog
1989
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
SEQUENTIAL ABSTRACT MACHINE FOR FCP 87 An FCP term is either a variable or a structure. ...
where H is the head of the clause, each Gi is a system-defined test called a guard, and each B, is a general body goal. An FCP program is a finite set of clauses. ...
The design of the abstract machine and the implementation of its emulator were part of a group project, and ideas of many are incorporated in this work. ...
doi:10.1016/0743-1066(89)90011-3
fatcat:gtdydjcuu5ckjaiw3ptgxeh72i
Ternary Electronic Logic Systems Automation: A Novel Study Based on VHDL Language Third Part: Ternary Non-Combinational (Sequential) Logic Components
2020
Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this scientific paper, the third part of the software library for the Ternary non-combinational (Sequential) logic components (the components that store information) will be built based on VHDL language ...
Mouftah, "A study on the implementation of three-valued logic," in
Proceedings of the sixth international symposium on Multiple-valued
logic, 1976, pp. 123-126.
]10[ C.-Y. Wu and H.-Y. ...
Huang, "Design and application of pipelined dynamic
CMOS ternary logic and simple ternary differential logic," IEEE journal of
solid-state circuits, vol. 28, pp. 895-906, 1993.
]11[ A. ...
doi:10.20428/jst.24.2.3
fatcat:nlatk7ge7fc6vguakmputod2kq
A Sequential Logic iLab Utilizing NI ELVIS II+ and the Interactive iLab Architecture
2012
International Journal of Online Engineering (iJOE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper presents work undertaken at Makerere University to develop a synchronous sequential logic iLab based on this architecture. ...
The research builds on previous work undertaken by the same researcher, in which a combinational digital logic iLab was developed. ...
All synchronous sequential digital logic devices obtain their synchronism from a clock of some sort. ...
doi:10.3991/ijoe.v8i3.2114
fatcat:fmcoprypsvc63a5cjyine3zi3y
Sequential convergence of regular measures on prehilbert space logics
2006
Journal of Mathematical Analysis and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper investigates Nikodym-type and Cafiero-type convergence theorems for regular charges in the general set-up of projection logics of prehilbert spaces. ...
Acknowledgment The authors are indebted to the referee for his valuable remarks which improved the readability of the paper. ...
We investigate some measure-theoretic properties of the projection logic of an inner product space (see [4, 9, 13] ). Let S be an inner product space. ...
doi:10.1016/j.jmaa.2005.05.041
fatcat:kyhz4i6rlrabjpu5iowuso2iru
A posteriori convergence in complete Boolean algebras with the sequential topology
2007
Annals of Pure and Applied Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
B converges to b ∈ B a priori (in These two forms of convergence, as well as the properties of the sequential topology related to forcing, are investigated. ...
A sequence x = x n : n ∈ ω of elements of a complete Boolean algebra (briefly c.B.a.) ...
The sequential compactness of τ s A nice example of the interplay between the properties of the sequential topology and the properties of complete Boolean algebras related to forcing is the theorem of ...
doi:10.1016/j.apal.2007.05.002
fatcat:wcsqtt267rextldxhisw3a3ebi
« Previous
Showing results 1 — 15 out of 318,572 results