Log in

Relevant bibliographies by topics / Expressibility / Journal articles

To see the other types of publications on this topic, follow the link: Expressibility.

Journal articles on the topic 'Expressibility'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Expressibility.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Nguyen, Hai Dang, Nam Hai Truong, and Thi Huyen Do. "Investigation of influence features on expression of lignocellulases in Escherichia coli and selection of bioinformatic tools for prediction of the enzymes expressibility based on amino acid sequences." Research Journal of Biotechnology 17, no. 3 (2022): 119–28. http://dx.doi.org/10.25303/1703rjbt119128.

Full text

Abstract:

Lignocellulases are the most important enzymes for bioeconomy development and have gained many interests in mining new coding-genes from metagenomic DNA data recently. However, the identification of genes suitable for successful expression in E. coli for the enzyme characterization is still a big challenge. In this study, 18 lignocellullase genes from metagenomic data of bacteria in goats' rumen, termite gut and humus were expressed in E. coli. Then 18 nucleotide and amino acid sequences were used to measure 12 impact features and to investigate tools for prediction of their E. coli expressibi

APA, Harvard, Vancouver, ISO, and other styles

2

Rusu, Andrei, and Elena Rusu. "On some classes of formulas in S5 which are pre-complete relative to existential expressibility." Computer Science Journal of Moldova 31, no. 3(93) (2023): 395–408. http://dx.doi.org/10.56415/csjm.v31.21.

Full text

Abstract:

Existential expressibility for all k-valued functions was proposed by A. V. Kuznetsov and later was investigated in more details by S. S. Marchenkov. In the present paper, we consider existential expressibility in the case of formulas defined by a logical calculus and find out some conditions for a system of formulas to be closed relative to existential expressibility. As a consequence, it has been established some pre-complete as to existential expressibility classes of formulas in some finite extensions of the paraconsistent modal logic S5.

APA, Harvard, Vancouver, ISO, and other styles

3

MANDELKERN, MATTHEW. "MODALITY AND EXPRESSIBILITY." Review of Symbolic Logic 12, no. 4 (2019): 768–805. http://dx.doi.org/10.1017/s1755020318000394.

Full text

Abstract:

AbstractWhen embedding data are used to argue against semantic theory A and in favor of semantic theory B, it is important to ask whether A could make sense of those data. It is possible to ask that question on a case-by-case basis. But suppose we could show that A can make sense of all the embedding data which B can possibly make sense of. This would, on the one hand, undermine arguments in favor of B over A on the basis of embedding data. And, provided that the converse does not hold—that is, that A can make sense of strictly more embedding data than B can—it would also show that there is a

APA, Harvard, Vancouver, ISO, and other styles

4

Gomaa, Walid. "Expressibility in ∑11." JUCS - Journal of Universal Computer Science 14, no. (10) (2008): 1654–77. https://doi.org/10.3217/jucs-014-10-1654.

Full text

Abstract:

Inspired by Fagin's result that NP = ∑11, we have developed a partial framework to investigate expressibility inside ∑11 so as to have a finer look into NP. The framework uses interesting combinatorics derived from second-order Ehrenfeucht-Fraïssé games and the notion of game types. Some of the results that have been proven within this framework are: (1) for any k, divisibility by k is not expressible by a ∑11 sentence where (1.i) each second-order variable has arity at most 2, (1.ii) the first-order part has at most 2 first-order variables, and (1.iii) the first-order part has quantifier dept

APA, Harvard, Vancouver, ISO, and other styles

5

Nakaji, Kouhei, and Naoki Yamamoto. "Expressibility of the alternating layered ansatz for quantum computation." Quantum 5 (April 19, 2021): 434. http://dx.doi.org/10.22331/q-2021-04-19-434.

Full text

Abstract:

The hybrid quantum-classical algorithm is actively examined as a technique applicable even to intermediate-scale quantum computers. To execute this algorithm, the hardware efficient ansatz is often used, thanks to its implementability and expressibility; however, this ansatz has a critical issue in its trainability in the sense that it generically suffers from the so-called gradient vanishing problem. This issue can be resolved by limiting the circuit to the class of shallow alternating layered ansatz. However, even though the high trainability of this ansatz is proved, it is still unclear whe

APA, Harvard, Vancouver, ISO, and other styles

6

Lee, Jinhee. "Dialetheism, Revenge and Expressibility." CHUL HAK SA SANG : Journal of Philosophical Ideas 77 (August 31, 2020): 75–104. http://dx.doi.org/10.15750/chss.77.202008.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Aleshin, Stanislav Vladimirovich, Dmitry Nikolaevich Babin, and Anatolii Aleksandrovich Chasovskikh. "Automata: Completeness, Expressibility, Application." Mathematical Problems of Cybernetics, no. 22 (2024): 223–75. https://doi.org/10.20948/mvk-2024-223.

Full text

Abstract:

The study of expressive properties in classes of discrete control systems has become the most important direction of development of the Russian school of cybernetics, one of the founders of which is Sergey Vsevolodovich Yablonsky. Of particular interest are the classes of finite automata widely used, in particular, for modeling integrated circuits. The paper provides an overview of the results of studies of the expressive properties of automata obtained within the framework of the scientific school of S.V. Yablonsky and his associates since its foundation.

APA, Harvard, Vancouver, ISO, and other styles

8

Norn, Mogens. "Expressibility of Meibomian secretion." Acta Ophthalmologica 65, no. 2 (2009): 137–42. http://dx.doi.org/10.1111/j.1755-3768.1987.tb06991.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Immerman, Neil. "Expressibility and Parallel Complexity." SIAM Journal on Computing 18, no. 3 (1989): 625–38. http://dx.doi.org/10.1137/0218043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Rusu, Andrei. "Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions." Analele Universitatii "Ovidius" Constanta - Seria Matematica 22, no. 1 (2014): 247–55. http://dx.doi.org/10.2478/auom-2014-0020.

Full text

Abstract:

AbstractIn the present paper we consider a non-tabular extension L of the well-known propositional provability logic GL together with the notion of parametric expressibility of formulas in a logic proposed by A. V. Kuznetsov. We prove that there are infinitely many precomplete with respect to parametric expressibility classes of formulas in the above mentioned logic L.

APA, Harvard, Vancouver, ISO, and other styles

11

Hella, Lauri, Leonid Libkin, and Juha Nurmonen. "Notions of locality and their logical characterizations over finite models." Journal of Symbolic Logic 64, no. 4 (1999): 1751–73. http://dx.doi.org/10.2307/2586810.

Full text

Abstract:

AbstractMany known tools for proving expressibility bounds for first-ordér logic are based on one of several locality properties. In this paper we characterize the relationship between those notions of locality. We note that Gaifman's locality theorem gives rise to two notions: one deals with sentences and one with open formulae. We prove that the former implies Hanf's notion of locality, which in turn implies Gaifman's locality for open formulae. Each of these implies the bounded degree property, which is one of the easiest tools for proving expressibility bounds. These results apply beyond t

APA, Harvard, Vancouver, ISO, and other styles

12

Andréka, Hajnal, Ivo Düntsch, and István Németi. "Expressibility of properties of relations." Journal of Symbolic Logic 60, no. 3 (1995): 970–91. http://dx.doi.org/10.2307/2275768.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Hella, Lauri, and José M. Turull-Torres. "Expressibility of Higher Order Logics." Electronic Notes in Theoretical Computer Science 84 (September 2003): 129–40. http://dx.doi.org/10.1016/s1571-0661(04)80850-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Shapiro, Lionel. "Expressibility and the Liar's Revenge." Australasian Journal of Philosophy 89, no. 2 (2011): 297–314. http://dx.doi.org/10.1080/00048401003695156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Marcus, Leo, and Telis Menas. "Expressibility of output equals input." Acta Informatica 29, no. 6-7 (1992): 645–62. http://dx.doi.org/10.1007/bf01185565.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Molzan, B. "Expressibility and Nonuniform Complexity Classes." SIAM Journal on Computing 19, no. 3 (1990): 411–23. http://dx.doi.org/10.1137/0219026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Aceto, Luca, and Anna Ingolfsdottir. "On the expressibility of priority." Information Processing Letters 109, no. 1 (2008): 83–85. http://dx.doi.org/10.1016/j.ipl.2008.09.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Bonner, Anthony J. "Hypothetical datalog: complexity and expressibility." Theoretical Computer Science 76, no. 1 (1990): 3–51. http://dx.doi.org/10.1016/0304-3975(90)90011-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Stewart, Iain A. "Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machine." Fundamenta Informaticae 18, no. 1 (1993): 93–105. http://dx.doi.org/10.3233/fi-1993-18106.

Full text

Abstract:

This paper continues an investigation into the expressibility of the logic (±HP)*[FOS]. In particular, we show that the logic (±HP)*[FOS] has the same expressibility as its sub-logic (±HP)1[FOS] which is known to capture the complexity class LNP (this class being those sets of strings accepted by some logspace deterministic oracle Turing machine with an oracle in NP). We consequently show that a naturally defined hierarchy within PNP collapses.

APA, Harvard, Vancouver, ISO, and other styles

20

Marchenkov, S. S. "Implicit Expressibility in Multiple-Valued Logic." Moscow University Computational Mathematics and Cybernetics 46, no. 3 (2022): 149–55. http://dx.doi.org/10.3103/s0278641922030086.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Niu, Yun-Fei, Shuo Zhang, and Wan-Su Bao. "Warm Starting Variational Quantum Algorithms with Near Clifford Circuits." Electronics 12, no. 2 (2023): 347. http://dx.doi.org/10.3390/electronics12020347.

Full text

Abstract:

As a mainstream approach in the quantum machine learning field, variational quantum algorithms (VQAs) are frequently mentioned among the most promising applications for quantum computing. However, VQAs suffer from inefficient training methods. Here, we propose a pretraining strategy named near Clifford circuits warm start (NCC-WS) to find the initialization for parameterized quantum circuits (PQCs) in VQAs. We explored the expressibility of NCCs and the correlation between the expressibility and acceleration. The achieved results suggest that NCC-WS can find the correct initialization for the

APA, Harvard, Vancouver, ISO, and other styles

22

Hančl, Jaroslav, and Jan Šustek. "Sequences of cantor type and their expressibility." Mathematica Slovaca 67, no. 1 (2017): 41–50. http://dx.doi.org/10.1515/ms-2016-0246.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Bulatov, Andrei, Leslie Ann Goldberg, Mark Jerrum, David Richerby, and Stanislav Živný. "Functional clones and expressibility of partition functions." Theoretical Computer Science 687 (July 2017): 11–39. http://dx.doi.org/10.1016/j.tcs.2017.05.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

MAREK, VICTOR W., and JEFFREY B. REMMEL. "On the expressibility of stable logic programming." Theory and Practice of Logic Programming 3, no. 4+5 (2003): 551–67. http://dx.doi.org/10.1017/s1471068403001777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Fu, Bin, and Qiongzhang Li. "The expressibility of first order dynamic logic." Journal of Computer Science and Technology 7, no. 3 (1992): 268–73. http://dx.doi.org/10.1007/bf02946577.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Rabinovich, Alexander. "Modularity and expressibility for nets of relations." Acta Informatica 35, no. 4 (1998): 293–327. http://dx.doi.org/10.1007/s002360050122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Pereboom, Derk. "Mathematical expressibility, perceptual relativity, and secondary qualities." Studies in History and Philosophy of Science Part A 22, no. 1 (1991): 63–88. http://dx.doi.org/10.1016/0039-3681(91)90015-k.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Stewart, Iain A. "Monotonicity and the Expressibility of NP Operators." Mathematical Logic Quarterly 40, no. 1 (1994): 132–40. http://dx.doi.org/10.1002/malq.19940400118.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Zhang, Hong, Yuqing Wu, Xichen Wan, et al. "Effect of Hypochlorous Acid on Blepharitis through Ultrasonic Atomization: A Randomized Clinical Trial." Journal of Clinical Medicine 12, no. 3 (2023): 1164. http://dx.doi.org/10.3390/jcm12031164.

Full text

Abstract:

Purpose: To evaluate the efficacy and safety of eyelid hygiene using topical 0.01% hypochlorous acid (HOCL) through ultrasonic atomization after 2 weeks in patients with blepharitis. Design: Randomized controlled trial. Methods: Patients with blepharitis were randomized into two groups: topical 0.01% HOCL through ultrasonic atomization (HOCL group, 42 eyes) or eyelid scrubs (control group, 37 eyes). Patients in both groups received warm compresses twice daily and topical 0.5% levofloxacin three times a day. Primary outcomes were the ocular surface disease index scores (OSDI), lid margin rednes

APA, Harvard, Vancouver, ISO, and other styles

30

VAN DER HOEK, W., and J. J. CH MEYER. "MAKING SOME ISSUES OF IMPLICIT KNOWLEDGE EXPLICIT." International Journal of Foundations of Computer Science 03, no. 02 (1992): 193–223. http://dx.doi.org/10.1142/s0129054192000139.

Full text

Abstract:

We discuss issues of expressibility and completeness of the logic of implicit knowledge (I) and “everybody’s knowledge” (E), as introduced in a system with a number m of epistemic agents by Halpern & Moses. The operator E is defined as a conjunction and corresponds semantically to the union of the m accessibility relations. Dually, the operator I is semantically associated with an intersection, but it is, surprisingly, not equivalent with a disjunction. From the view of Kripke structures there is a related asymmetry: although union can be modally defined, intersection cannot! We discuss co

APA, Harvard, Vancouver, ISO, and other styles

31

Marchenkov, Sergey S. "On implicit extensions in many-valued logic." Discrete Mathematics and Applications 34, no. 5 (2024): 277–82. http://dx.doi.org/10.1515/dma-2024-0024.

Full text

Abstract:

Abstract We consider Kuznetsov’s implicit expressibility and its generalizations, when the implicit expressibility language is augmented with the additional disjunction, implication, and negation logical connectives. It is shown that, for each k ⩾ 3, the implicit extensions in Pk have the cardinality of the continuum. For each k ⩾ 3, we also prove that each of the sets of positively implicit, implicatively implicit, and negatively implicit extensions in Pk contains, respectively, as a proper subset, the set of positively implicit, implicatively implicit, and negatively implicit closed classes.

APA, Harvard, Vancouver, ISO, and other styles

32

Czerwiński, Wojciech, Sibylle Fröschle, and Sławomir Lasota. "Partially-commutative context-free processes: Expressibility and tractability." Information and Computation 209, no. 5 (2011): 782–98. http://dx.doi.org/10.1016/j.ic.2010.12.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Hidders, Jan, Stefania Marrara, Jan Paredaens, and Roel Vercammen. "On the expressibility of functions in XQuery fragments." Information Systems 33, no. 4-5 (2008): 435–55. http://dx.doi.org/10.1016/j.is.2008.01.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bateman, John A. "Expressibility and the problem of efficient text planning." Machine Translation 11, no. 4 (1996): 243–49. http://dx.doi.org/10.1007/bf00387397.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Akrom, Muhamad, and Wahyu Aji Eko Prabowo. "Classical-Quantum CNN Hybrid for Image Classification." Techno.Com 18, no. 4 (2019): 361–71. https://doi.org/10.62411/tc.v18i4.12488.

Full text

Abstract:

This study explores Quantum Convolutional Neural Network (QCNN) starting from foundational quantum operations, such as the Rx gate for encoding MNIST image data into quantum states. We implemented quantum convolutional and pooling layers using one_unitary and two_unitary circuits, enabling effective feature extraction and dimensionality reduction while preserving critical information. Expressibility analysis revealed varying capabilities across different one_unitary circuits, with Rx, Ry, and Rz combinations demonstrating promising results akin to Haar random states. The proposed QCNN model ex

APA, Harvard, Vancouver, ISO, and other styles

36

Chen, Chih-Chieh, Masaya Watabe, Kodai Shiba, Masaru Sogabe, Katsuyoshi Sakamoto, and Tomah Sogabe. "On the Expressibility and Overfitting of Quantum Circuit Learning." ACM Transactions on Quantum Computing 2, no. 2 (2021): 1–24. http://dx.doi.org/10.1145/3466797.

Full text

Abstract:

Applying quantum processors to model a high-dimensional function approximator is a typical method in quantum machine learning with potential advantage. It is conjectured that the unitarity of quantum circuits provides possible regularization to avoid overfitting. However, it is not clear how the regularization interplays with the expressibility under the limitation of current Noisy-Intermediate Scale Quantum devices. In this article, we perform simulations and theoretical analysis of the quantum circuit learning problem with hardware-efficient ansatz. Thorough numerical simulations show that t

APA, Harvard, Vancouver, ISO, and other styles

37

Jensen, C. U. "Solvability by Real Radicals and Fermat Primes." Canadian Mathematical Bulletin 47, no. 2 (2004): 229–36. http://dx.doi.org/10.4153/cmb-2004-022-9.

Full text

Abstract:

AbstractWe give a survey of old and new results concerning the expressibility of the real roots of a solvable polynomial over a real number field by real radicals. A characterization of Fermat primes is obtained in terms of solvability by real radicals for certain ploynomials.

APA, Harvard, Vancouver, ISO, and other styles

38

Lu, Shourong, and Qichun Jin. "Expressibility Required to Design Embedded and Real-time Systems." Journal of Physics: Conference Series 1345 (November 2019): 022031. http://dx.doi.org/10.1088/1742-6596/1345/2/022031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Maria Turull Torres, Jose. "On the expressibility and the computability of untyped queries." Annals of Pure and Applied Logic 108, no. 1-3 (2001): 345–71. http://dx.doi.org/10.1016/s0168-0072(00)00055-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Černá, Ivana, Mojmír Křetínsky, and Antonín Kučera. "Comparing expressibility of normed BPA and normed BPP processes." Acta Informatica 36, no. 3 (1999): 233–56. http://dx.doi.org/10.1007/s002360050159.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Karhumäki, Juhani, Filippo Mignosi, and Wojciech Plandowski. "The expressibility of languages and relations by word equations." Journal of the ACM 47, no. 3 (2000): 483–505. http://dx.doi.org/10.1145/337244.337255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

CELLINI, M., L. CELLINI, P. VERSURA, and EC CAMPOS. "Meibomian glands diagnostic expressibility: a new diagnostic medical device." Acta Ophthalmologica 88 (September 2010): 0. http://dx.doi.org/10.1111/j.1755-3768.2010.305.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Faĭziev, Valeriĭ A., and Prasanna K. Sahoo. "Pseudocharacters and the Problem of Expressibility for Some Groups." Journal of Algebra 250, no. 2 (2002): 603–37. http://dx.doi.org/10.1006/jabr.2001.9137.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Starostin, Mikhail V. "On some implicitly precomplete classes of monotone functions in Pk." Discrete Mathematics and Applications 30, no. 1 (2020): 45–51. http://dx.doi.org/10.1515/dma-2020-0005.

Full text

Abstract:

AbstractThe paper is concerned with the completeness problem in implicit expressibility in a multi-valued logics Pk. For each k ≥ 2 and any nontrivial order relation on the set {0, 1, …, k − 1} we find two implicitly precomplete classes of functions which are monotone with respect to this order

APA, Harvard, Vancouver, ISO, and other styles

45

Li, Weina, Xiaofeng Li, Feilun Cui, Zhipeng Xu, Nuo Dong, and Cheng Li. "The Ocular Surface Characteristics in Prostate Cancer Patients Treated with Androgen Deprivation Therapy." Disease Markers 2021 (November 9, 2021): 1–6. http://dx.doi.org/10.1155/2021/5390195.

Full text

Abstract:

Background.To investigate the association of long-term androgen deprivation therapy (ADT) with ocular surface characteristics in prostate cancer patients. Methods. A total of 30 male prostate cancer patients who received ADT were selected. All candidates were scored using the Ocular Surface Disease Index (OSDI) and subsequently divided into two groups containing 9 symptomatic patients (scores >12) and 21 asymptomatic patients ( scores ≤ 12 ). Another 20 healthy age-matched males were selected as the control group. Each candidate was assessed with respect to eyelid margin abnormality, tear f

APA, Harvard, Vancouver, ISO, and other styles

46

Song, Peng, Zhuo Sun, Shengwei Ren, et al. "Preoperative Management of MGD Alleviates the Aggravation of MGD and Dry Eye Induced by Cataract Surgery: A Prospective, Randomized Clinical Trial." BioMed Research International 2019 (April 11, 2019): 1–10. http://dx.doi.org/10.1155/2019/2737968.

Full text

Abstract:

Purpose. To investigate the effect of preoperative treatment and postoperative enhanced anti-inflammatory treatment on alleviating meibomian gland dysfunction (MGD) and dry eye induced by cataract surgery. Design. Prospective, randomized clinical trial. Methods. A total of 120 cataract patients with moderate obstructive-MGD were enrolled and randomized with 60:30:30 number of patients in cohorts I, II, and III, respectively: Cohort I: routine postoperative anti-inflammatory treatment; Cohort II: preoperative treatment (warming compress, lid hygiene, and anti-inflammatory treatment) and routine

APA, Harvard, Vancouver, ISO, and other styles

47

Баротов, Д. Н., and Р. Н. Баротов. "On one criterion of expressibility of functions of a system of linear differential equations with constant coefficients in the form of linear combinations of derivatives of one function included in this system." Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), no. 3 (June 29, 2023): 260–74. http://dx.doi.org/10.26089/nummet.v24r319.

Full text

Abstract:

Исследуется задача выразимости всех функций x1(t), x2(t), . . . , xn(t), входящих в заданную однородную систему линейных дифференциальных уравнений с постоянными коэффициентами x′(t) = A·x(t), в виде линейных комбинаций производных только одной неизвестной функции xk(t), входящей в эту систему. Найден простой критерий выразимости всех функций системы x′(t) = A·x(t) в виде линейных комбинаций производных xk(t) и доказана его корректность. На основе доказанного критерия разработан соответствующий алгоритм и обоснована его корректность. In this paper, we study the problem of expressibility of all

APA, Harvard, Vancouver, ISO, and other styles

48

Meadows, Jillian F., Padmapriya Ramamoorthy, Jason J. Nichols, and Kelly K. Nichols. "Development of the 4–3–2–1 Meibum Expressibility Scale." Eye & Contact Lens: Science & Clinical Practice 38, no. 2 (2012): 86–92. http://dx.doi.org/10.1097/icl.0b013e318242b494.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Belleri, Delia. "The Underdeterminacy of Sentences and the Expressibility of Our Thoughts." Dialectica 70, no. 1 (2016): 29–48. http://dx.doi.org/10.1111/1746-8361.12126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Švejdar, V., and K. Bendová. "On inter-expressibility of logical connectives in Gödel fuzzy logic." Soft Computing 4, no. 2 (2000): 103–5. http://dx.doi.org/10.1007/s005000000036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!