Results 261 to 270 of about 1,512,917 (302)
Some of the next articles are maybe not open access.
Logic Journal of IGPL, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blackburn, P., Tzakova, M.
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blackburn, P., Tzakova, M.
openaire +4 more sources
Network Completion: Beyond Matrix Completion
2021 International Conference on Information Networking (ICOIN), 2021Due to practical reasons such as limited resources and privacy settings specified by users on social media, most network data tend to be only partially observed with both missing nodes and missing edges. Thus, it is of paramount importance to infer the missing parts of the networks since incomplete network data may severely degrade the performance of ...
Cong Tran, Won-Yong Shin
openaire +2 more sources
1987
We have seen, in Proposition 8.26, that for filters on a uniform space convergence implies the Cauchy condition, while the converse implication is generally false. This suggests.
openaire +1 more source
We have seen, in Proposition 8.26, that for filters on a uniform space convergence implies the Cauchy condition, while the converse implication is generally false. This suggests.
openaire +1 more source
Cognitive Psychology, 1999
The visual system completes image fragments into larger regions when those fragments are taken to be the visible portions of an occluded object. Kellman and Shipley (1991) argued that this "amodal" completion is based on the way that the contours of image fragments "relate." Contours relate when their imaginary extensions intersect at an obtuse or ...
openaire +3 more sources
The visual system completes image fragments into larger regions when those fragments are taken to be the visible portions of an occluded object. Kellman and Shipley (1991) argued that this "amodal" completion is based on the way that the contours of image fragments "relate." Contours relate when their imaginary extensions intersect at an obtuse or ...
openaire +3 more sources
Bulletin of Symbolic Logic, 1996
AbstractThis is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The
openaire +3 more sources
AbstractThis is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The
openaire +3 more sources
Completions and Complete Representations
2013The title of this chapter indicates a rather technical topic, but it can also be thought of as a foundational issue in logic. The question to be considered is this: to what extent can we use an abstract mathematical language to express and reason about relations?
Robin Hirsch, Ian Hodkinson
openaire +1 more source
8. Pre-completion procedures and completion
2014This chapter begins with a discussion of pre-completion procedures, covering pre-completion when acting for the seller; pre-completion when acting for the buyer; pre-completion searches; and completion statements. It then focuses on completion, covering date, time, and place for completion; when the client is both selling and buying; and the mechanics ...
Robert M. Abbey, Mark B. Richards
openaire +1 more source
Completely automatic completion of VLSI designs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990Most VLSI designs consist of a number of blocks, like RAMs, ROMs, data paths, and random logic, which ultimately must be integrated. Methods for performing this integration have generally required manual intervention, such as the iterative operation of placement programs and routing programs.
openaire +2 more sources
Arithmetical completeness versus relative completeness
Studia Logica, 1988By using nonstandard models for arithmetics and Skolemization techniques, the author shows that as far as finitistic proof systems for dynamic logic are concerned, we cannot expect more than D. Harel's arithmetical completeness.
openaire +3 more sources
Complete groups are complete co-analytic
Archive for Mathematical Logic, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source