Truth functions realizable by single threshold organs

A threshold function is a mapping from {0, 1}n into {0, 1} satisfying: there exists integers w1, w2,..., wn, t such that f(x1, x2,..., xn) = 1 iff Sigmai=1n wi xi \geq t. Two chains of conditions necessary for a function to be a threshold function are discussed. Early parts of the two chains are equ...

Full description

Saved in:
Bibliographic Details
Published in2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961) pp. 225 - 245
Main Author Elgot, Calvin C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.1961
Subjects
Online AccessGet full text
DOI10.1109/FOCS.1961.39

Cover

Abstract A threshold function is a mapping from {0, 1}n into {0, 1} satisfying: there exists integers w1, w2,..., wn, t such that f(x1, x2,..., xn) = 1 iff Sigmai=1n wi xi \geq t. Two chains of conditions necessary for a function to be a threshold function are discussed. Early parts of the two chains are equivalent. One chain constitutes a sufficient condition while it is not known whether the other more intrinsic condition is sufficient or not. It is shown that any set of threshold functions of n variables realizable by a common set of weights is included in a maximal chain of threshold functions of length 1 + 2n realizable by a common set of weights. If f depends on at most 5 variables or if f or its dual has at most 4-prime implicants, then f is a threshold function iff it is 2-monotonic.
AbstractList A threshold function is a mapping from {0, 1}n into {0, 1} satisfying: there exists integers w1, w2,..., wn, t such that f(x1, x2,..., xn) = 1 iff Sigmai=1n wi xi \geq t. Two chains of conditions necessary for a function to be a threshold function are discussed. Early parts of the two chains are equivalent. One chain constitutes a sufficient condition while it is not known whether the other more intrinsic condition is sufficient or not. It is shown that any set of threshold functions of n variables realizable by a common set of weights is included in a maximal chain of threshold functions of length 1 + 2n realizable by a common set of weights. If f depends on at most 5 variables or if f or its dual has at most 4-prime implicants, then f is a threshold function iff it is 2-monotonic.
Author Elgot, Calvin C.
Author_xml – sequence: 1
  givenname: Calvin C.
  surname: Elgot
  fullname: Elgot, Calvin C.
BookMark eNotzL1uwjAUQGEPdADarRuLXyCpbxz_jSiCtlIkBrIjx1wTS8FBdhjg6Vupnc43nRVZxCkiIe_ASgBmPvaH5liCkVBysySiS_d5oP4e3RymmGlCO4an7Uek_YPmEC-_moeEeZjGM53Sxcb8Sl68HTO-_XdNuv2ua76K9vD53WzbIhg2F-ix1pL1wCSvmWHWWI-yEo5XCrRnWmqhhJZKKC1rzitXe2cVYC-cAAC-Jpu_bUDE0y2Fq02Pk-BGVUrzH8xvPds
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/FOCS.1961.39
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EndPage 245
ExternalDocumentID 5397278
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-efe4860b10634090a9afe625c32718f086857586757864332c4fca71eb5c51113
IEDL.DBID RIE
IngestDate Thu Jun 29 18:11:48 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-efe4860b10634090a9afe625c32718f086857586757864332c4fca71eb5c51113
PageCount 21
ParticipantIDs ieee_primary_5397278
PublicationCentury 1900
PublicationDate 1961-Oct.
PublicationDateYYYYMMDD 1961-10-01
PublicationDate_xml – month: 10
  year: 1961
  text: 1961-Oct.
PublicationDecade 1960
PublicationTitle 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961)
PublicationTitleAbbrev FOCS
PublicationYear 1961
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.1573136
Snippet A threshold function is a mapping from {0, 1}n into {0, 1} satisfying: there exists integers w1, w2,..., wn, t such that f(x1, x2,..., xn) = 1 iff Sigmai=1n wi...
SourceID ieee
SourceType Publisher
StartPage 225
SubjectTerms Sufficient conditions
Title Truth functions realizable by single threshold organs
URI https://ieeexplore.ieee.org/document/5397278
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NS8NAEB3anjyptOI3e_Dops3HZpNzsRShKliht5LdzKIorbTJwf56Zza1injwtuSS3czAy5t9Mw_gCpXL2flNojGJTEpdysJlocyNjstBWKSZ5XrH5C4dPyW3MzVrwfWuFwYRvfgMA176u_xyaWsulfUVgWeksza0Kc2aXq2dlj3vj-6HjwElVBiw8_cPrxQPFaN9mHy9pFGIvAZ1ZQK7-TV_8b-7OIDed1OeeNjBzSG0cNEFNV3V1bNgdPIJJOgf0Au13lCYD8GFAFpVFLA13zMJb-K07sF0dDMdjuXWCUG-5INKokP2ijJE32LiY4MiLxwScbFxRNDiiJWwz2aW8mz6lAeS2cTZQodolFXsJX8EncVygccgsthobXRRqihPSkURUhojk6bOJZaozwl0-cTz92bWxXx72NO_H5_BHn_wRtx2Dp1qVeMFgXRlLn10PgGhHZQz
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV09T8MwED2VMsAEqEV844GRpE1ix8lcURVoCxJB6lbFzlkgUIvaZIBfj88pBSEGNiuLP87Syzu_uwdwgcKk5PzmoVLc44UsvNwkgZcqGRXdII8TTfmO0TgePPKbiZg04HJdC4OITnyGPg3dW34x1xWlyjrCgmcokw3YtLjPRV2ttVazp53-Xe_Bt1cq8Mn7-4dbigOL_g6MvqapNSIvflUqX3_86sD433XsQvu7LI_drwFnDxo4a4HIFlX5xAif3BVi9i_QSbVekal3RqkAOyptyJb00sScjdOyDVn_KusNvJUXgvecdksPDZJblLIELrKMrJunuUFLXXQUWnAxlpeQ02YSU3f6mFqSaW50LgNUQgtyk9-H5mw-wwNgSaSkVDIvRJjyQtgYCYmhimNjuLbk5xBatOPpW93tYrra7NHfn89ha5CNhtPh9fj2GLbp8Gup2wk0y0WFpxayS3XmIvUJlgSXgA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2nd+Annual+Symposium+on+Switching+Circuit+Theory+and+Logical+Design+%28SWCT+1961%29&rft.atitle=Truth+functions+realizable+by+single+threshold+organs&rft.au=Elgot%2C+Calvin+C.&rft.date=1961-10-01&rft.pub=IEEE&rft.spage=225&rft.epage=245&rft_id=info:doi/10.1109%2FFOCS.1961.39&rft.externalDocID=5397278